# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200516 | arnold518 | JOIOJI (JOI14_joioji) | C++14 | 50 ms | 6264 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 ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5;
int N;
char S[MAXN+10];
struct tup
{
int a, b, c;
bool operator < (const tup &p) const
{
if(a!=p.a) return a<p.a;
if(b!=p.b) return b<p.b;
return c<p.c;
}
};
map<tup, int> M;
int ans;
int main()
{
int i, j;
scanf("%d%s", &N, S+1);
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... |