oj.uz

Submission #332807

# Submission time Handle Problem Language Result Execution time Memory
332807 2020-12-03T12:39:27 Z SPyofgame Coin Collecting (JOI19_ho_t4) C++14
0 / 100
 1 ms 364 KB 
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <set>

using namespace std;

int main()
{  
    int n;
    cin >> n;

    int m = 2;
    long long res = 0;
    for (int q = n << 1; q-->0; )
    {
        int x, y;
        cin >> x >> y;

        int dx = (x < 1) ? 1 - x : (x > n) ? x - n : 0;
        int dy = (y < 1) ? 1 - y : (y > m) ? y - m : 0;
        res += dx + dy;
    }

    cout << res;
    return 0;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 29.0

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

Subtask #3
0 / 63.0

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