Submission #2630574

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

bool solve(int N, vi& t, vi& x, vi& y) {
    int at=0, ax=0, ay=0;
    rep(i, N){
        int dt=t[i]-at, dx=x[i]-ax, dy=y[i]-ay, d=dx+dy;
        at=t[i]; ax=x[i]; ay=y[i];
        if (d > dt) return false;
        // d <= dt
        if ((dt - d) % 2) return false;
    }
    return true;
}

int main() {
    int N; cin >> N;
    vi t(N), x(N), y(N);
    rep(i,N) cin >> t[i] >> x[i] >> y[i];
    cout << (solve(N,t,x,y) ? "Yes" : "No") << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Traveling
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1554 Byte
Status
Exec Time 73 ms
Memory 1408 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_000.txt, 0_001.txt, 0_002.txt
All 300 / 300 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 1 ms 256 KB
0_001.txt 1 ms 256 KB
0_002.txt 1 ms 256 KB
1_003.txt 1 ms 256 KB
1_004.txt 73 ms 1408 KB
1_005.txt 69 ms 1408 KB
1_006.txt 62 ms 1408 KB
1_007.txt 10 ms 384 KB
1_008.txt 1 ms 256 KB
1_009.txt 14 ms 512 KB
1_010.txt 1 ms 256 KB
1_011.txt 9 ms 384 KB
1_012.txt 1 ms 256 KB