点击查看代码
#include <windows.h>
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <ctime>
#define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i ++ )
#define rop(i, a, b) for (int i = (a); i < (b); i ++ )
using namespace std;
void COLOR_PRINT(const char* s, int color) {
HANDLE handle = GetStdHandle(STD_OUTPUT_HANDLE);
SetConsoleTextAttribute(handle, FOREGROUND_INTENSITY | color);
printf(s);
SetConsoleTextAttribute(handle, FOREGROUND_INTENSITY | 7);
}
void sub() {
puts("Input Your Program : ");
string In; cin >> In;
puts("Input Standard example : ");
string k; cin >> k;
puts("Input examples : ");
int n; cin >> n;
rep(i, 1, n) {
double st = clock();
string t = k + to_string(i) + ".in";
string a = In + ".exe < " + t + " > tmp.out";
string b = "fc tmp.out " + k + to_string(i) + ".ans > 1.log";
system(a.c_str());
if (!system(b.c_str()))
COLOR_PRINT("Test Passed!\n", 2);
else COLOR_PRINT("Test Failed!\n", 4);
double ed = clock();
printf("Time Use : %.5lf\n", (double)(ed - st) / CLOCKS_PER_SEC);
}
}
signed main() {
while (T -- ) sub();
return 0;
}
点击查看代码
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i ++ )
#define rop(i, a, b) for (int i = (a); i < (b); i ++ )
#define dep(i, a, b) for (int i = (a); i >= (b); i -- )
#define dop(i, a, b) for (int i = (a); i > (b); i -- )
#define Darr(a, L, R) (cerr << #a "[" << L << " ~ " << R << "] = "; rep(x, L, R) cerr << a[x] << " "; cerr << '\n';)
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define D(x) (cerr << #x << " = " << x << '\n')
#define vit vector<int>::iterator
#define all(x) x.begin(), x.end()
#define min(a, b) (a < b ? a : b)
#define max(a, b) (a > b ? a : b)
#define chkmin(a, b) (a = min(a, b))
#define chkmax(a, b) (a = max(a, b))
#define sit set<int>::iterator
#define lowbit(x) (x & -x)
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pi acos(-1)
#define gc getchar
#define pc putchar
#define db double
#define y second
#define x first
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<db, db> PDD;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
const int mod = 998244353;
const int eps = 1e-9;
const int N = 1000010; int T = 1;
void print(int x) { dep(i, 20, 0) pc(((x >> i) & 1) ? '1' : '0'); }
int qpow(int a, int b = mod - 2, int s = 1) { for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) s = 1ll * s * a % mod; return s; }
namespace IO {
void read() { return; }
void write(char ch) { pc(ch); return; }
void write() { return; }
template <typename T> void read(T &x) { x = 0; T w = 0; char ch = gc(); while (ch < '0' || ch > '9') w |= (ch == '-'), ch = gc(); while ('0' <= ch && ch <= '9') x = x * 10 + (ch ^ 48), ch = gc(); x = w ? -x : x; }
template <typename T> void print(T x) { if (!x) return; print<T>(x / 10), pc((x % 10) ^ '0'); }
template <typename T> void write(T x) { if (x > 0) print<T>(x); else if (x < 0) pc('-'), print<T>(-x); else pc('0'); }
template <typename T> void write(T x, char en) { write<T>(x), pc(en); }
template <typename T, typename ...T2> void read(T &s, T2 &...oth) { read(s); read(oth...); return; }
}; using namespace IO;
void sub() {
}
signed main() {
while (T -- ) sub();
return 0;
}
点击查看代码
#include <bits/stdc++.h>
#include <windows.h>
#define x first
#define y second
#define mp make_pair
#define rep(i, a, b) for (int i = (a); i <= (b); i ++ )
using namespace std;
const int N = 100010;
unsigned long long seed = 13351;
FILE *fp; int p[N];
using PII = pair<int, int>;
void O(int t) { fprintf(fp, "%d", t); }
void O(char t) { fprintf(fp, "%c", t); }
unsigned long long rd() {
seed ^= seed >> 13;
seed ^= seed << 5;
seed ^= seed >> 17;
return seed;
}
int random(int l, int r) { if (l > r) return 0; return rd() % (r - l + 1) + l; }
void Build_Chain(int n, int k) {
O(n); O(' '); O(k); O('\n');
rep(i, 1, n) p[i] = i;
rep(i, 1, n * 5) swap(p[random(1, n)], p[random(1, n)]);
rep(i, 2, n) O(p[i]), O(' '), O(p[i - 1]), O('\n');
}
void Build_Flower(int n, int k) {
O(n); O(' '); O(k); O('\n');
rep(i, 2, n) O(i), O(' '), O(1), O('\n');
}
void Build_Simple(int n, int k) {
O(n), O(' '), O(k), O('\n');
rep(i, 2, n) O(i), O(' '), O(random(max(1, i - 5), i - 1)), O('\n');
}
void Build(int n, int k) {
int now = 0;
vector<PII> path;
while (now < n) {
int op = rd() & 1;
int won = now + (op ? k : k + 1);
rep(i, now + 2, won) path.push_back(mp(now + 1, i));
if (now) path.push_back(mp(now + 1, now)); now = won;
} O(now), O(' '), O(k), O('\n');
for (auto i : path)
O(i.x), O(' '), O(i.y), O('\n');
}
void work(int t) {
int n = 50000;
int k = (rd() & 1) ? sqrt(n) : n - sqrt(n);
int op = rd() % 10;
if (op <= 1) Build_Flower(n, 1);
else if (op <= 5) Build_Chain(n, k);
else { Build(n, k); }
}
int main() {
Sleep(1000);
srand(time(0)); seed = rand(); char s[100];
for (int i = 31; i <= 37; i ++ ) {
sprintf(s, "E%d.in", i);
fp = fopen(s, "w");
work(i); fclose(fp); fp = 0;
sprintf(s, "E.exe < E%d.in > E%d.out", i, i);
system(s);
cerr << "The " << i << "th finished.\n";
} return 0;
}
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 【.NET】调用本地 Deepseek 模型
· CSnakes vs Python.NET:高效嵌入与灵活互通的跨语言方案对比
· DeepSeek “源神”启动!「GitHub 热点速览」
· 我与微信审核的“相爱相杀”看个人小程序副业
· Plotly.NET 一个为 .NET 打造的强大开源交互式图表库