oj.uz

Submission #1100213

# Submission time Handle Problem Language Result Execution time Memory
1100213 2024-10-13T09:56:45 Z vjudge1 Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int main()
{
    int n, k = 0;
    cin >> n;
    vector<int> a(3);
    for(int i = 0; i < n * 2; i++)
    {
        int x, y;
        cin >> x >> y;
        x = max(1, min(n, x));
        y = max(1, min(2, y));
        a[y]++;
    }
    int x1 = a[1] - n;
    int x2 = a[2] - n;
    k += abs(x1) + abs(x2);
    cout << k;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 29.0

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

Subtask #3
0 / 63.0

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