oj.uz

답안 #535085

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535085 2022-03-09T11:32:45 Z farhan132 송금 (JOI19_remittance) C++17
0 / 100
 1 ms 332 KB 
/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>



using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define PI 3.14159265359
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctz(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)

const ll mod =  (ll) 998244353;
const ll maxn = (ll)2e5 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
//const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};

bool USACO = 0;

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<ll, null_type,less< ll >, rb_tree_tag,tree_order_statistics_node_update>

const ll N = 1e6 + 5;

ll a[N] , b[N];

void solve(){

    ll n;
    cin >> n;

    for(ll i = 1; i <= n; i++) cin >> a[i] >> b[i];

    for(ll itr = 0; itr < 32; itr++){
      for(ll i = 1; i <= n; i++)
        if(a[i] > b[i]){
          ll x = (a[i] - b[i])/2;
          a[i] -= 2*x;
          a[i%n + 1] += x;
        }
    }

    bool ok1 = 1 , ok2 = 1;

    for(ll i = 1; i <= n; i++){
      if(a[i] != b[i]) ok1 = 0;
      if(a[i] - 1 != b[i] || a[i] == 1) ok2 = 0;
    }
    if(ok1 || ok2) cout << "Yes\n";
    else cout << "No\n";


   return;
}

 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
    #else 
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
      
    #endif
    //pre(N);
    
    ll T = 1;
    //cin >> T;
    ll CT = 0;
    while(T--){
      //  cout << "Case #" << ++CT <<": " ;
        solve();
    }
 
    return 0;
}

Compilation message

remittance.cpp: In function 'int main()':
remittance.cpp:111:8: warning: unused variable 'CT' [-Wunused-variable]
  111 |     ll CT = 0;
      |        ^~

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Incorrect 0 ms 332 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Incorrect 0 ms 332 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Incorrect 0 ms 332 KB Output isn't correct
9 Halted 0 ms 0 KB -