# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
442327 | minoum | Trobojnica (COCI19_trobojnica) | C++17 | 279 ms | 19416 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 long long int ll;
const int MAXN = 2e5+10;
int n, cnt[4], nxt[MAXN], nxtc[MAXN], prv[MAXN], prvc[MAXN];
string s;
vector <pair<pair<int,int>,int>> ans;
set <int> dif[4];
inline int oth(int x, int y){
if(x!=1&&y!=1) return 1;
if(x!=2&&y!=2) return 2;
return 3;
}
inline void add(int i){
if(nxtc[i]!=prvc[i]){
dif[nxtc[i]].insert(i);
dif[prvc[i]].insert(i);
}
return;
}
inline void rmv(int i){
if(nxtc[i]!=prvc[i]){
dif[nxtc[i]].erase(i);
dif[prvc[i]].erase(i);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |