# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
479395 | Arvin | Crossing (JOI21_crossing) | C++11 | 7034 ms | 10200 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 ull unsigned long long
#define ll long long
#define ui unsigned int
#define us unsigned short
#define inf_int 1e9
#define inf_ll 1e18
#define mod 1000000007
#define smod 998244353
const int maxN = 2e5 + 5;
const ll base = 5;
int n;
ll prefix[maxN];
ll convert(char c){
if(c == 'J') return 0;
else if(c == 'O') return 1;
else if(c == 'I') return 2;
return 3;
}
struct SegTree { // index start from 0 (v)
ll tree[8*maxN], lazy[8*maxN];
void build(int v, int l, int r, string s){
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... |