# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
198077 | dndhk | Editor (BOI15_edi) | C++14 | 262 ms | 60380 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 pb push_back
using namespace std;
const int MAX_N = 300000;
const int MAX_K = 20;
typedef pair<int, int> pii;
vector<pii> vt;
int prv[MAX_N+1];
int N;
vector<pii> v;
int num[MAX_N+1];
int chk[MAX_N+1];
priority_queue<int> pq1, pq2;
vector<int> vc;
int cnt[MAX_N+1];
pii frt[MAX_N+1][MAX_K+1];
void make_prv(){
for(int i=0; i<N; i++){
if(vt[i].first==1){
for(int j=0; j<MAX_K; j++){
frt[i][j] = {i, 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... |