# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
423594 | patrikpavic2 | Crossing (JOI21_crossing) | C++17 | 709 ms | 17796 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 <cstdio>
#include <cstring>
#include <map>
using namespace std;
const int N = 2e5 + 500;
const int BS = 31337;
const int OFF = (1 << 18);
int pot[N], P_pot[N], sol[N];
int prop[2 * OFF], T[2 * OFF];
int A[N][3], ql[N], qr[N], qq[N];
map < int, int > dobar;
void precompute(){
pot[0] = 1, P_pot[0] = 1;
for(int i = 1;i < N;i++){
pot[i] = pot[i - 1] * BS;
P_pot[i] = pot[i] + P_pot[i - 1];
}
}
int kod(char c){
if(c == 'J') return 0;
if(c == 'O') return 1;
return 2;
}
void refresh(int i, int l, int r){
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... |