oj.uz

Submission #681698

# Submission time Handle Problem Language Result Execution time Memory
681698 2023-01-13T18:08:55 Z edogawa_something Remittance (JOI19_remittance) C++17
0 / 100
 452 ms 332 KB 
#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%10),aa[(i+1)%n]+=(x%10);
    x/=10;
  }
  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(10,n)){
    ans|=chk(i);
  }
  if(ans)
  cout<<"Yes\n";
  else
  cout<<"No\n";
  return 0; 
}
/*

*/

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 418 ms 332 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 6 ms 212 KB Output is correct
6 Correct 424 ms 296 KB Output is correct
7 Correct 452 ms 300 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 42 ms 296 KB Output is correct
11 Correct 436 ms 300 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 42 ms 212 KB Output is correct
15 Correct 426 ms 304 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 43 ms 212 KB Output is correct
19 Correct 426 ms 300 KB Output is correct
20 Incorrect 439 ms 296 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 418 ms 332 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 6 ms 212 KB Output is correct
6 Correct 424 ms 296 KB Output is correct
7 Correct 452 ms 300 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 42 ms 296 KB Output is correct
11 Correct 436 ms 300 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 42 ms 212 KB Output is correct
15 Correct 426 ms 304 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 43 ms 212 KB Output is correct
19 Correct 426 ms 300 KB Output is correct
20 Incorrect 439 ms 296 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 418 ms 332 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 6 ms 212 KB Output is correct
6 Correct 424 ms 296 KB Output is correct
7 Correct 452 ms 300 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 42 ms 296 KB Output is correct
11 Correct 436 ms 300 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 42 ms 212 KB Output is correct
15 Correct 426 ms 304 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 43 ms 212 KB Output is correct
19 Correct 426 ms 300 KB Output is correct
20 Incorrect 439 ms 296 KB Output isn't correct
21 Halted 0 ms 0 KB -