oj.uz

Submission #1075372

# Submission time Handle Problem Language Result Execution time Memory
1075372 2024-08-26T04:42:13 Z Cyanberry Circle selection (APIO18_circle_selection) C++14
0 / 100
 677 ms 34464 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    unordered_map<int, int> map1, map2;
    int circles, a, b, c;
    cin>>circles;
    for (int i = 1; i <= circles; ++i) {
        cin>>a>>b>>c;
        if (map1[a] == map2[b] && map1[a] != 0) {
            cout<<map1[a]<<' ';
        } else {
            map1[a] = i;
            map2[b] = i;
            cout<<i<<' ';
        }
    }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 578 ms 21332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 677 ms 34464 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -