# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
232585 | 2020-05-17T13:49:47 Z | crossing0ver | Languages (IOI10_languages) | C++17 | 540 ms | 2040 KB |
#include<bits/stdc++.h> #include "grader.h" #include "lang.h" using namespace std; bool s[56][65536]; int A[56]; vector<int> G; int vis[65536]; void excerpt(int E[]) { int ca = 1; for (int i = 0; i <= 55; i++) { for (int j = 0; j < 100; j++) { G.push_back(E[j]); if (s[i][E[j]] && !vis[E[j]]) if (j < 3) A[i] += 5, vis[E[j]] = 1; else A[i]++, vis[E[j]] = 1; } for (int g:G) vis[g] = 0; G.clear(); } for (int i = 0; i <= 55; i++) if (A[i] > A[ca]) ca = i; memset (A,0,sizeof A); int d = language(ca); for (int i = 0; i < 100; i++) s[d][E[i]]|=1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 535 ms | 2040 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 540 ms | 1992 KB | Output is partially correct - 52.39% |