oj.uz

Submission #968865

# Submission time Handle Problem Language Result Execution time Memory
968865 2024-04-24T08:01:59 Z Circling Set (COCI21_set) C++17
40 / 110
 1000 ms 35912 KB 
/*The British Royal Family and a small cadre of English Fabian Socialists, in
conjunction with the Rockefellers and the Rothchilds, are engaged in a
conspiracy to greatly reduce the population of the human race in order to head
off a Malthusian catastrophe, a catastrophe that could easily be avoided by
simply building a massive amount of nuclear power plants and a number of massive
superhighways and bridges to connect all of the world's continents. But doing
that would cut into the conspiracy's profits. So the British Royal Family
invented environmentalism and neoliberalism in order to hide the truth. And in
order to further reduce the population, the British Royal Family is also the
world's foremost drug trafficking conspiracy. And it uses its control of the IMF
to push austerity in order to kill as many people in the global south as
possible.
And also Henry Kissinger is a gay KGB agent. */
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;


int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    int n, k, pow3, curr, ans, s1, s2;
    cin >> n >> k;
    vector<int> cardvec;
    set<int> cardset;
    char c;
    for (int i = 0; i < n; i++){
        pow3 = 1;
        curr = 0;
        for (int j = 0; j < k; j++){
            cin >> c;
            curr += pow3 * (c - '1');
            pow3 *= 3;
        }
        cardvec.push_back(curr);
        cardset.insert(curr);
    }
    for (int i = 1; i < n; i++){
        for (int j = 0; j < i; j++){
            curr = 0;
            pow3 = 1;
            for (int p = 0; p < k; p++){
                s1 = (cardvec[i] / pow3) % 3;
                s2 = (cardvec[j] / pow3) % 3;
                if (s1 == s2) curr += s1 * pow3;
                else curr += (3 - s1 - s2) * pow3;
                pow3 *= 3;
            }
            if (cardset.find(curr) != cardset.end()) ans++;
        }
    }
    cout << ans / 3;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:58:19: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   58 |     cout << ans / 3;
      |                   ^

Subtask #1
10.0 / 10.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 3 ms 464 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 408 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 308 ms 572 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 452 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 296 ms 464 KB Output is correct
24 Correct 17 ms 456 KB Output is correct
25 Correct 286 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 278 ms 548 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 3 ms 464 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 408 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 308 ms 572 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 452 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 296 ms 464 KB Output is correct
24 Correct 17 ms 456 KB Output is correct
25 Correct 286 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 278 ms 548 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Execution timed out 1058 ms 35912 KB Time limit exceeded
35 Halted 0 ms 0 KB -