oj.uz

Submission #950200

# Submission time Handle Problem Language Result Execution time Memory
950200 2024-03-20T06:51:04 Z vjudge1 Remittance (JOI19_remittance) C++17
0 / 100
 817 ms 4572 KB 
#include <bits/stdc++.h>

#pragma optimize("Ofast,unroll-loops")
#pragma target("avx2")

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
#define int ll

const int MAX=2e5+10;
const int B=500;
const int maxB=1000;
const int N=104;
const int block=450;
const int inf=2e9;  
const int mod=1e9+7;
const int mod1=1e9+9;
const ld eps=1e-9;

int dx[8]={1,0,-1,0,1,-1,-1,1};
int dy[8]={0,1,0,-1,1,-1,1,-1};

int binpow(int a,int n){
  if(!n)return 1;
  if(n%2==1)return a*binpow(a,n-1)%mod;
  int k=binpow(a,n/2);
  return k*k%mod;
}

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

int n;
int a[MAX],b[MAX];

int r(int i){
  return i%n+1;
}

int bit(int i,int j){
  return (i>>j)&1;
}

int p[MAX],c[MAX];
bool ok=0;

bool check(){
  int na[10];
  for(int i=1;i<=n;i++)na[i]=a[i];
  for(int i=1;i<=n;i++){
    if(p[i]==1){
      na[i]-=2*c[i];
      na[r(i)]+=c[i];
    }
    else if(p[i]==2){
      na[i]-=4*c[i];
      na[r(r(i))]+=c[i];
    }
  }
  for(int i=1;i<=n;i++){
    if(na[i]!=b[i])return 0;
  }
  return 1;
}

void calc(int i){
  if(i==n+1){
    ok|=check();
    return;
  }
  p[i]=0;
  c[i]=0;
  calc(i+1);
  p[i]=1;
  for(c[i]=1;c[i]<=5;c[i]++){
    calc(i+1);
  }
  p[i]=2;
  for(c[i]=1;c[i]<=5;c[i]++){
    calc(i+1);
  }
}

void solve(){
  cin>>n;
  for(int i=1;i<=n;i++)cin>>a[i]>>b[i];
  calc(1);
  if(ok){
    cout<<"Yes\n";
    return;
  }
  cout<<"No\n";
}

signed main(){
  // freopen("triangles.in","r",stdin);
  // freopen("triangles.out","w",stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // prec();
  int t=1;
  // cin>>t;
  while(t--){
    solve();
  }
}

Compilation message

remittance.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize("Ofast,unroll-loops")
      | 
remittance.cpp:4: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    4 | #pragma target("avx2")
      |

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 813 ms 4552 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 6 ms 4440 KB Output is correct
6 Correct 814 ms 4552 KB Output is correct
7 Correct 811 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 2 ms 4440 KB Output is correct
10 Correct 64 ms 4552 KB Output is correct
11 Correct 817 ms 4548 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4572 KB Output is correct
14 Correct 65 ms 4568 KB Output is correct
15 Correct 813 ms 4556 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 1 ms 4572 KB Output is correct
18 Correct 64 ms 4552 KB Output is correct
19 Correct 813 ms 4552 KB Output is correct
20 Incorrect 815 ms 4556 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 813 ms 4552 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 6 ms 4440 KB Output is correct
6 Correct 814 ms 4552 KB Output is correct
7 Correct 811 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 2 ms 4440 KB Output is correct
10 Correct 64 ms 4552 KB Output is correct
11 Correct 817 ms 4548 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4572 KB Output is correct
14 Correct 65 ms 4568 KB Output is correct
15 Correct 813 ms 4556 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 1 ms 4572 KB Output is correct
18 Correct 64 ms 4552 KB Output is correct
19 Correct 813 ms 4552 KB Output is correct
20 Incorrect 815 ms 4556 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 813 ms 4552 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 6 ms 4440 KB Output is correct
6 Correct 814 ms 4552 KB Output is correct
7 Correct 811 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 2 ms 4440 KB Output is correct
10 Correct 64 ms 4552 KB Output is correct
11 Correct 817 ms 4548 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4572 KB Output is correct
14 Correct 65 ms 4568 KB Output is correct
15 Correct 813 ms 4556 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 1 ms 4572 KB Output is correct
18 Correct 64 ms 4552 KB Output is correct
19 Correct 813 ms 4552 KB Output is correct
20 Incorrect 815 ms 4556 KB Output isn't correct
21 Halted 0 ms 0 KB -