# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
205986 | rzbt | Checker (COCI19_checker) | C++14 | 963 ms | 76276 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 mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 200005
typedef long long ll;
using namespace std;
int n;
set<pair<int,int> > graf[MAXN];
map<pair<int,int>, int> grane;
char s[MAXN];
int a,b,boja;
inline pair<int,int> ugranu(int a,int b){
return mp(min(a,b),max(a,b));
}
queue<int> usi;
int bojenje=0;
int main()
{
scanf("%*d");
scanf("%d", &n);
scanf("%s",s);
for(int i=1;i<n;i++){
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... |