Submission #681696

#	Time	Username	Problem	Language	Result	Execution time	Memory
681696		edogawa_something	Remittance (JOI19_remittance)	C++17	0 / 100	2 ms	212 KiB

remittance

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;  
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef string st;
typedef bool bl;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
typedef vector<pii> vpi;
#define pu push
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define fast ios_base::sync_with_stdio(0);cin.tie();
#define test ll qqqqq;cin>>qqqqq;while(qqqqq--)
#define F first
#define S second
#define forn(i,n) for(ll i=0;i<n;i++)
#define forx(i,j,n) for(ll i=j;i<n;i++)
#define pb push_back
#define pob pop_back
#define all(v) v.begin(),v.end()  
#define lb lower_bound
#define ub upper_bound
#define pof pop_front
#define pow powww
#define prtll(x) printf("%lld",x)
#define prtld(x) printf("%Lf",x)
#define prtst(x) printf("%s",x)
#define prtch(x) printf("%c",x)
#define measure chrono::high_resolution_clock::now()
const ll dx[]{1,0,-1,0};
const ll dy[]{0,-1,0,1};
const ll inf=2e18;
//const ll mod=1e9+7;
const ll LM=1e7+2;
const ll M=3e5+10;
const ll MM=5002;
const ll MMM=101;
const ld pi=acos(-1);
const ll mod=998244353;
ll pow(ll r,ll to,ll m=mod){
  ll res=1;
  while(to){
    if((to&1))
    res*=r,res%=m;
    r*=r,r%=m;
    to=(to>>1);
  } 
  return res;
}
ll n,a[M],b[M],aa[M];
bl chk(ll x){
  forn(i,n) 
  aa[i]=a[i];
  forn(i,n){
    aa[i]-=2*(x%4),aa[(i+1)%n]+=(x%4);
    x/=4;
  }
  forn(i,n){
    if(aa[i]!=b[i])
    return 0;
  }
  return 1;
}
int main(){
  bl ans=0;
  cin>>n;
  forn(i,n)
  cin>>a[i]>>b[i];
  forn(i,pow(4,n)){
    ans|=chk(i);
  }
  if(ans)
  cout<<"Yes\n";
  else
  cout<<"No\n";
  return 0; 
}
/*

*/

• Subtask 1: 0 / 15
• Subtask 2: 0 / 40
• Subtask 3: 0 / 45