oj.uz

Submission #516846

# Submission time Handle Problem Language Result Execution time Memory
516846 2022-01-22T07:37:17 Z Marslai24 Set (COCI21_set) C++17
40 / 110
 1000 ms 37616 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long // a.k.a. TLE creator
#define all(x) x.begin(), x.end()
template<class A, class B> istream& operator >>(istream &o, pair<A, B> &x){return o >> x.first >> x.second;}
template<class A, class B> ostream& operator <<(ostream &o, pair<A, B> &x){return o << x.first << ' ' << x.second << ' ';}
void setIO(){ios::sync_with_stdio(false); cin.tie(0);}
const int INF = INT_MAX, MOD = 998244353, N = 1e6, K = __lg(N) + 1;

signed main(){
    setIO();
    int n, k;
    cin >> n >> k;
    int pw[k + 1]{1};
    for(int i = 1; i <= k; i++)pw[i] = pw[i - 1] * 10;
    vector<int> s(n);
    for(auto &i : s)cin >> i;
    map<int, int> cnt;
    for(int i = 0; i < n; i++){
        for(int j = i + 1; j < n; j++){
            int now = 0, x = s[i], y = s[j];
            for(int l = 0; l < k; l++, x /= 10, y /= 10){
                if(x % 10 == y % 10)now += x % 10 * pw[l];
                else{
                    for(int c = 1; c <= 3; c++){
                        if(x % 10 != c && y % 10 != c)now += c * pw[l];
                    }
                }
            }
            cnt[now]++;
        }
    }
    int ans = 0;
    for(auto i : s){
        ans += cnt[i];
    }
    cout << ans / 3;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 3 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 4 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 3 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 4 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 265 ms 444 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 341 ms 460 KB Output is correct
24 Correct 21 ms 332 KB Output is correct
25 Correct 341 ms 460 KB Output is correct
26 Correct 4 ms 332 KB Output is correct
27 Correct 320 ms 460 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 3 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 4 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 265 ms 444 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 341 ms 460 KB Output is correct
24 Correct 21 ms 332 KB Output is correct
25 Correct 341 ms 460 KB Output is correct
26 Correct 4 ms 332 KB Output is correct
27 Correct 320 ms 460 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Execution timed out 1076 ms 37616 KB Time limit exceeded
35 Halted 0 ms 0 KB -