oj.uz

답안 #238269

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
238269 2020-06-10T15:18:07 Z egekabas 송금 (JOI19_remittance) C++14
0 / 100
 5 ms 384 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<ll, ll> pii;
typedef pair<ld, ld> pld;
ll n;
ll a[1000009], b[1000009], dif[1000009];
ll in[1000009], out[1000009];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n;
    for(ll i = 0; i < n; ++i)
        cin >> a[i] >> b[i];
    for(ll i = 0; i < n; ++i)
        dif[i] = a[i]-b[i];
    for(ll i = n-1; i >= 0; --i){
        in[i] = out[i]*2-dif[i];
        out[(i-1+n)%n] = in[i];
    }
    for(ll i = n-1; i >= 0; --i){
        in[i] = out[i]*2-dif[i];
        out[(i-1+n)%n] = in[i];
    }
    for(ll i = 0; i < n; ++i)
        if(out[(i-1+n)%n] != in[i]){
            cout << "No\n";
            return 0;
        }
    cout << "Yes\n";
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -