Submission #2124584


Source Code Expand

#include <iostream>
#include <vector>
#include <stdio.h>

using namespace std;

int main(int argc, char const *argv[]){
    int N;
    cin >> N;
    int t[N], x[N], y[N];
    for (int i = 0; i < N; i++) {
      cin >> t[i] >> x[i] >> y[i];
    }

    int now_x, now_y, now = 0;
    for (int i = 0; i < N; i++){
      int dt = t[i] - now;
      int dx = abs(x[i] - now_x);
      int dy = abs(y[i] - now_y);
      int tmp = dt - dx - dy;
      if(tmp >=0 && tmp%2 == 0){
        now = t[i];
        now_x = x[i];
        now_y = y[i];
      }else{
        cout << "No" << "\n";
        return 0;
      }
    }
    cout << "Yes" << "\n";
    return 0;
}

Submission Info

Submission Time
Task C - Traveling
User dasina
Language C++14 (GCC 5.4.1)
Score 300
Code Size 683 Byte
Status AC
Exec Time 90 ms
Memory 1408 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 13
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
1_003.txt AC 1 ms 256 KB
1_004.txt AC 90 ms 1408 KB
1_005.txt AC 85 ms 1408 KB
1_006.txt AC 74 ms 1408 KB
1_007.txt AC 12 ms 384 KB
1_008.txt AC 1 ms 256 KB
1_009.txt AC 16 ms 512 KB
1_010.txt AC 1 ms 256 KB
1_011.txt AC 11 ms 384 KB
1_012.txt AC 1 ms 256 KB