# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43524 | ffresh | JOIOJI (JOI14_joioji) | C++14 | 96 ms | 12304 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;
const int N = 2e5+15,M = 3;
int convert(char x){
if(x=='I')return 0;
else if(x=='O')return 1;
return 2;
}
int sum[N][M];
int Hash[N][M];
#define mp make_pair
bool check(pair<int,pair<int,int> > t){
if(t.first== t.second.first && t.first== t.second.second)return 1;
return 0;
}
int main(){
//freopen("input.txt","r",stdin);
int n;
string s;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |