| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 57240 | Crown | Languages (IOI10_languages) | C++14 | 10057 ms | 84176 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 "grader.h"
#include "lang.h"
#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
#define SZ 100
#define lng 55
#define ch 65535
const ll all = 1LL*ch*ch;
map<ll, double> mp[60];
int cnt[60];
map<ll, int> freq;
void excerpt(int *E)
{
freq.clear();
for(int i = 0; i+1< 100; i++)
{
ll help = E[i]*ch+E[i+1];
freq[help]++;
}
int best = -1;
double bestdiff = 1e18;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||