# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
908597 | lighton | Tenis (COI19_tenis) | C++17 | 1066 ms | 9672 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 forf(i,a,b) for(int i = a; i<=b; i++)
#define all(v) v.begin(),v.end()
typedef long long ll;
using namespace std;
int N,Q;
int rnk[3][100001];
int pos[3][100001];
int cnt[100001];
set<int> possible;
void findpossible(){
forf(i,1,N) cnt[i] = 0;
int noncomplete = 0;
possible.clear();
forf(i,1,N){
forf(j,0,2){
cnt[rnk[j][i]]++;
if(cnt[rnk[j][i]] == 1){
noncomplete++;
possible.insert(rnk[j][i]);
}
if(cnt[rnk[j][i]] == 3) noncomplete--;
}
if(noncomplete == 0) return;
}
}
int main(){
scanf("%d %d" , &N,&Q);
forf(i,0,2) forf(j,1,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... |