# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
222391 | dwsc | Checker (COCI19_checker) | C++14 | 847 ms | 32832 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> ii;
struct node{
int next;
int colour;
node(int _next,int _colour){
next = _next;
colour = _colour;
}
};
int n;
bool cmp(ii e1,ii e2){
int dist1 = abs(e1.first-e1.second),dist2 = abs(e2.first-e2.second);
dist1 = min(dist1,n-dist1);
dist2 = min(dist2,n-dist2);
return dist1 < dist2;
}
string invalid = "neispravna triangulacija";
string notpat = "neispravno bojenje";
string pat = "tocno";
int main(){
int t;
cin >> t;
cin >> n;
int colour[n];
string s;
cin >> s;
for (int i = 0; i < n; i++) colour[i] = s[i]-48;
set<int> available;
# | 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... |