# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20910 | model_code | Rope (JOI17_rope) | C++14 | 843 ms | 23508 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;
typedef pair<int,int> pi;
const int INF=5e8;
const int MAX_N=1000005;
int app[MAX_N];
int d[MAX_N],ans[MAX_N];
int N,C;
pi ps[500005];
int pscnt[500005];
void chmin(int& a,int b){
a=min(a,b);
}
void solve(int n,int* ar,int L,int R){
if(n&1) return;
if(n==0){
for(int i=0;i<C;++i) ans[i]=0;
return;
}
int m=0;
for(int i=0;i<n;i+=2){
int a=ar[i],b=ar[i+1];
if(a>b) swap(a,b);
ps[m++]={a,b};
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... |