oj.uz

Submission #320201

# Submission time Handle Problem Language Result Execution time Memory
320201 2020-11-07T22:54:58 Z Karen124 PIN (CEOI10_pin) C++14
60 / 100
 117 ms 51624 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll N = 1e5 + 5;
const ll M = 36 + 5;
const ll K = 16 + 5; 
const ll O = 10;
ll n, d, z[O];
ll ans[O], ansp[O];
ll cn[K][M][M][M][M];
unordered_map <char, ll> f;
string a[N];
int main (){
    f['0'] = 0; f['1'] = 1; f['2'] = 2; f['3'] = 3; f['4'] = 4; f['5'] = 5; f['6'] = 6; f['7'] = 7;
    f['8'] = 8; f['9'] = 9; f['a'] = 10; f['b'] = 11; f['c'] = 12; f['d'] = 13; f['e'] = 14; f['f'] = 15;
    f['g'] = 16; f['h'] = 17; f['i'] = 18; f['j'] = 19; f['k'] = 20; f['l'] = 21; f['m'] = 22; f['n'] = 23;
    f['o'] = 24; f['p'] = 25; f['q'] = 26; f['r'] = 27; f['s'] = 28; f['t'] = 29; f['u'] = 30; f['v'] = 31;
    f['w'] = 32; f['x'] = 33; f['y'] = 34; f['z'] = 35; 
    cin >> n >> d;
    for (ll i = 0; i < n; i++){
        cin >> a[i];
        fill(ansp, ansp + O, 0);
        for (ll msk = 0; msk < 16; msk++){
            fill(z, z + O, 0);
            for (int j = 0; j < 4; j++){
                if ((msk >> j) & 1){
                    z[j] = f[a[i][j]];
                }
            }
            ansp[__builtin_popcount(msk)] += cn[msk][z[0]][z[1]][z[2]][z[3]]; 
            cn[msk][z[0]][z[1]][z[2]][z[3]] ++;
        }
        ans[4] += ansp[4];
        ans[3] += ansp[3] - ansp[4];
        ans[2] += ansp[2] - ansp[3] + ansp[4];
        ans[1] += ansp[1] - ansp[2] + ansp[3] - ansp[4];
        ans[0] += ansp[0] - ansp[1] + ansp[2] - ansp[3] + ansp[4];
    }
    cout << ans[4 - d] << '\n';
    return 0;
}

Subtask #1
60.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 10476 KB Output is correct
2 Incorrect 10 ms 10348 KB Output isn't correct
3 Correct 9 ms 10092 KB Output is correct
4 Correct 29 ms 11116 KB Output is correct
5 Correct 37 ms 11116 KB Output is correct
6 Incorrect 35 ms 11116 KB Output isn't correct
7 Incorrect 29 ms 11116 KB Output isn't correct
8 Correct 37 ms 11264 KB Output is correct
9 Correct 54 ms 11116 KB Output is correct
10 Incorrect 61 ms 11160 KB Output isn't correct
11 Incorrect 36 ms 11116 KB Output isn't correct
12 Incorrect 60 ms 11116 KB Output isn't correct
13 Incorrect 40 ms 11116 KB Output isn't correct
14 Correct 37 ms 11116 KB Output is correct
15 Correct 59 ms 11116 KB Output is correct
16 Correct 93 ms 51300 KB Output is correct
17 Incorrect 117 ms 51428 KB Output isn't correct
18 Correct 98 ms 51300 KB Output is correct
19 Correct 105 ms 51424 KB Output is correct
20 Correct 116 ms 51624 KB Output is correct