# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
222729 | kingfran1907 | Drvca (COCI19_drvca) | C++14 | 109 ms | 6900 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>
using namespace std;
const int maxn = 1e5+10;
int n;
int niz[maxn];
vector<int> a;
multiset<int> b;
map<int, int> m;
void print() {
printf("%d\n", a.size());
for (int i = 0; i < a.size(); i++)
printf("%d ", a[i]);
printf("\n%d\n", b.size());
for (auto iter = b.begin(); iter != b.end(); iter++)
printf("%d ", *iter);
printf("\n");
}
void print_deb() {
printf("a: ");
for (int i = 0; i < a.size(); i++)
printf("%d ", a[i]);
printf("\nb: ");
for (auto iter = b.begin(); iter != b.end(); iter++)
printf("%d ", *iter);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |