# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1104209 | manhlinh1501 | Exam (eJOI20_exam) | C++17 | 71 ms | 77896 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;
using i64 = long long;
const int MAXN = 2e5 + 5;
#define left ___left
#define right ___right
#define ALL(a) (a).begin(), (a).end()
using pii = pair<int, int>;
int N;
int a[MAXN];
int b[MAXN];
void compress() {
map<int, int> comp;
for(int i = 1; i <= N; i++) comp[a[i]] = 1;
for(int i = 1; i <= N; i++) comp[b[i]] = 1;
int c = 0;
for(auto &[x, y] : comp) y = ++c;
for(int i = 1; i <= N; i++) a[i] = comp[a[i]];
for(int i = 1; i <= N; i++) b[i] = comp[b[i]];
}
namespace subtask2 {
bool is_subtask() {
for(int i = 1; i < N; i++) {
if(b[i] != b[i + 1]) return false;
}
return true;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |