# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
893717 | noiaint | Exam (eJOI20_exam) | C++17 | 25 ms | 14696 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;
#define all(x) x.begin(), x.end()
const int N = 1e6 + 5;
bool maxi(int &x, int y) {
if (x < y) {
x = y;
return true;
}
return false;
}
int n;
int a[N], b[N];
int l[N], r[N];
namespace task2 {
bool check() {
for (int i = 1; i + 1 <= n; ++i) {
if (b[i] != b[i + 1]) return false;
}
return true;
}
int d[N];
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... |