# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1074868 | voi | Examination (JOI19_examination) | C++17 | 434 ms | 36052 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(s) s.begin(), s.end()
#define lb(s, a) lower_bound(all(s), (a)) - s.begin()
using namespace std;
typedef long long ll;
const int ar = 2e5 + 2;
const ll mod = 1e9 + 7;
const int oo = 2e9;
struct BIT {
vector<vector<int>> c, t;
bool b;
BIT(int n) {
b = 0;
c = vector<vector<int>>(n);
t = vector<vector<int>>(n);
}
void init() {
b = 1;
for (int i = 0; i < c.size(); i++) {
sort(c[i].begin(), c[i].end());
c[i].resize(unique(c[i].begin(), c[i].end()) - c[i].begin());
t[i] = vector<int>(c[i].size(), 0);
}
}
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... |