# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154735 | arnold518 | PIN (CEOI10_pin) | C++14 | 149 ms | 3148 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 = 5e4;
int N, D;
int A[MAXN+10][5], T[5]={1, 40, 40*40, 40*40*40};
ll ans[5];
int f(char x)
{
if('0'<=x && x<='9') return x-'0';
else return x-'a'+10;
}
int solve()
{
int i, j, k, p, q;
for(i=0; i<4; i++)
{
map<int, int> M;
for(j=1; j<=N; j++)
{
ans[1]+=M[A[j][4]-A[j][i]];
M[A[j][4]-A[j][i]]++;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |