# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
637328 | boris_mihov | Wiring (IOI17_wiring) | 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 <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <set>
typedef long long llong;
const int MAXN = 1000 + 10;
const llong INF = 1e18;
int n, m;
int r[MAXN];
int b[MAXN];
int perm[MAXN];
int rndVal[MAXN];
std::set <int> cnt;
int main()
{
srand(time(nullptr));
int n = rand()%3+3;
int m = rand()%3+3;
std::iota(perm + 1, perm + 1 + n + m, 1);
std::random_shuffle(perm + 1, perm + 1 + n + m);
for (int i = 1 ; i <= n+m ; ++i)
{
do rndVal[i] = rand()%100 + 1;
while (cnt.count(rndVal[i]));
cnt.insert(rndVal[i]);
}
std::sort(rndVal + 1, rndVal + 1 + n + m);
std::sort(perm + 1, perm + 1 + n);
std::sort(perm + 1 + n, perm + 1 + n + m);
std::cout << n << ' ' << m << '\n';
for (int i = 1 ; i <= n ; ++i) std::cout << rndVal[perm[i]] << ' '; std::cout << '\n';
for (int i = 1 ; i <= m ; ++i) std::cout << rndVal[perm[n + i]] << ' '; std::cout << '\n';
return 0;
}