oj.uz

답안 #357559

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
357559 2021-01-24T06:05:38 Z blue PIN (CEOI10_pin) C++17
30 / 100
 36 ms 10348 KB 
#include <iostream>
#include <vector>
using namespace std;

/*
There are 36^4 = 1679616 possibilities for the PIN.

Let them be numbered from 0 to 1679615.
Two PINS have one difference if their
*/

int adj(char c)
{
    if(c == '0') return 1;
    else if('1' <= c && c <= '9') return (c - '1') + 2;
    else return (c - 'a') + 11;
}

int ct[37][37][37][37];

int main()
{
    int N, D;
    cin >> N >> D;

    string S;
    vector< vector<int> > T(N, vector<int>(4));
    for(int i = 0; i < N; i++)
    {
        cin >> S;
        for(int j = 0; j < 4; j++) T[i][j] = adj(S[j]);
        for(int mask = 0; mask < (1 << 4); mask++)
        {
            ct[(mask & (1 << 0)) ? T[i][0] : 0]
              [(mask & (1 << 1)) ? T[i][1] : 0]
              [(mask & (1 << 2)) ? T[i][2] : 0]
              [(mask & (1 << 3)) ? T[i][3] : 0]++;
        }
    }

    long long res = 0;

    vector<int> X;

    if(D == 1)
    {
        for(int i = 0; i < N; i++)
        {
            X = T[i];
            res += ct[0][X[1]][X[2]][X[3]];
            res += ct[X[0]][0][X[2]][X[3]];
            res += ct[X[0]][X[1]][0][X[3]];
            res += ct[X[0]][X[1]][X[2]][0];
            res -= 4 * ct[X[0]][X[1]][X[2]][X[3]];
        }
    }
    else if(D == 2)
    {
        for(int i = 0; i < N; i++)
        {
            X = T[i];
            res += ct[0][0][X[2]][X[3]];
            res += ct[0][X[1]][0][X[3]];
            res += ct[0][X[1]][X[2]][0];
            res += ct[X[0]][0][0][X[3]];
            res += ct[X[0]][0][X[2]][0];
            res += ct[X[0]][X[1]][0][0];
            res -= 6 * ct[X[0]][X[1]][X[2]][X[3]];
        }
    }

    res /= 2;
    cout << res << '\n';
}

Subtask #1
30.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2028 KB Output is correct
2 Incorrect 2 ms 2028 KB Output isn't correct
3 Incorrect 2 ms 1900 KB Output isn't correct
4 Correct 10 ms 3052 KB Output is correct
5 Correct 12 ms 3180 KB Output is correct
6 Incorrect 14 ms 3180 KB Output isn't correct
7 Incorrect 12 ms 2924 KB Output isn't correct
8 Correct 17 ms 3436 KB Output is correct
9 Correct 20 ms 4332 KB Output is correct
10 Incorrect 22 ms 4588 KB Output isn't correct
11 Incorrect 12 ms 3308 KB Output isn't correct
12 Incorrect 20 ms 4460 KB Output isn't correct
13 Incorrect 17 ms 3564 KB Output isn't correct
14 Incorrect 16 ms 3308 KB Output isn't correct
15 Incorrect 25 ms 4460 KB Output isn't correct
16 Correct 25 ms 9452 KB Output is correct
17 Incorrect 36 ms 10348 KB Output isn't correct
18 Incorrect 23 ms 9708 KB Output isn't correct
19 Incorrect 26 ms 10092 KB Output isn't correct
20 Incorrect 30 ms 10348 KB Output isn't correct