# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931555 | nguyentunglam | Simurgh (IOI17_simurgh) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define endl "\n"
#define int long long
using namespace std;
const int N = 510 + 01;
int a[N][N];
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rng(1417415151);
long long rnd(long long l, long long r) {
return l + rng() % (r - l + 1);
}
int u[510], v[510];
int32_t main() {
for(int test = 1; test <= 100000; test ++) {
cerr << "Test Case #" << test << ":.....\n";
ofstream cout ("task.inp");
int n = rnd(4, 5), m = rnd(1, 4);
m = min(m, n * (n - 1) / 2 - n + 1);
vector<pair<int, int> > e;