답안 #950406

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
950406	2024-03-20T09:27:00 Z	vjudge1	송금 (JOI19_remittance)	C++17	100 / 100	266 ms	36504 KB

remittance

#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=1e6+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];

void solve(){
  cin>>n;
  for(int i=1;i<=n;i++)cin>>a[i]>>b[i];
  for(int F=1;F<=120;F++){
    for(int i=1;i<=n;i++){
      int r=i%n+1;
      if(a[i]-b[i]>1){
        int o=a[i]-b[i];
        a[r]+=o/2;
        a[i]-=o-o%2;
      }
    }
  }
  set<int> st;
  bool is=1;
  for(int i=1;i<=n;i++){
    if(a[i]<b[i]){
      cout<<"No\n";
      return;
    }
    else{
      if(a[i]!=1||b[i]!=0)is=0;
      st.in(a[i]-b[i]);
    }
  }
  if(sz(st)==1&&!is)cout<<"Yes\n";
  else 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
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	2 ms	2392 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	0 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2392 KB	Output is correct
29	Correct	1 ms	2516 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	1 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	2 ms	2392 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	0 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2392 KB	Output is correct
29	Correct	1 ms	2516 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	1 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	1 ms	2392 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	2 ms	2396 KB	Output is correct
37	Correct	1 ms	2408 KB	Output is correct
38	Correct	1 ms	2408 KB	Output is correct
39	Correct	0 ms	2396 KB	Output is correct
40	Correct	1 ms	2392 KB	Output is correct
41	Correct	1 ms	2396 KB	Output is correct
42	Correct	0 ms	2396 KB	Output is correct
43	Correct	1 ms	2396 KB	Output is correct
44	Correct	1 ms	2396 KB	Output is correct
45	Correct	1 ms	2396 KB	Output is correct
46	Correct	1 ms	2396 KB	Output is correct
47	Correct	1 ms	2396 KB	Output is correct
48	Correct	1 ms	2396 KB	Output is correct
49	Correct	1 ms	2396 KB	Output is correct
50	Correct	1 ms	2396 KB	Output is correct
51	Correct	1 ms	2396 KB	Output is correct
52	Correct	1 ms	2396 KB	Output is correct
53	Correct	1 ms	2396 KB	Output is correct
54	Correct	1 ms	2396 KB	Output is correct
55	Correct	0 ms	2396 KB	Output is correct
56	Correct	1 ms	2396 KB	Output is correct
57	Correct	1 ms	2396 KB	Output is correct
58	Correct	1 ms	2396 KB	Output is correct
59	Correct	1 ms	2396 KB	Output is correct
60	Correct	0 ms	2396 KB	Output is correct
61	Correct	1 ms	2396 KB	Output is correct
62	Correct	0 ms	2396 KB	Output is correct

Subtask #3
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	2 ms	2392 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	0 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2392 KB	Output is correct
29	Correct	1 ms	2516 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	1 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	1 ms	2392 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	2 ms	2396 KB	Output is correct
37	Correct	1 ms	2408 KB	Output is correct
38	Correct	1 ms	2408 KB	Output is correct
39	Correct	0 ms	2396 KB	Output is correct
40	Correct	1 ms	2392 KB	Output is correct
41	Correct	1 ms	2396 KB	Output is correct
42	Correct	0 ms	2396 KB	Output is correct
43	Correct	1 ms	2396 KB	Output is correct
44	Correct	1 ms	2396 KB	Output is correct
45	Correct	1 ms	2396 KB	Output is correct
46	Correct	1 ms	2396 KB	Output is correct
47	Correct	1 ms	2396 KB	Output is correct
48	Correct	1 ms	2396 KB	Output is correct
49	Correct	1 ms	2396 KB	Output is correct
50	Correct	1 ms	2396 KB	Output is correct
51	Correct	1 ms	2396 KB	Output is correct
52	Correct	1 ms	2396 KB	Output is correct
53	Correct	1 ms	2396 KB	Output is correct
54	Correct	1 ms	2396 KB	Output is correct
55	Correct	0 ms	2396 KB	Output is correct
56	Correct	1 ms	2396 KB	Output is correct
57	Correct	1 ms	2396 KB	Output is correct
58	Correct	1 ms	2396 KB	Output is correct
59	Correct	1 ms	2396 KB	Output is correct
60	Correct	0 ms	2396 KB	Output is correct
61	Correct	1 ms	2396 KB	Output is correct
62	Correct	0 ms	2396 KB	Output is correct
63	Correct	266 ms	31368 KB	Output is correct
64	Correct	184 ms	20088 KB	Output is correct
65	Correct	245 ms	34796 KB	Output is correct
66	Correct	182 ms	20000 KB	Output is correct
67	Correct	197 ms	21368 KB	Output is correct
68	Correct	218 ms	23636 KB	Output is correct
69	Correct	246 ms	35436 KB	Output is correct
70	Correct	186 ms	20008 KB	Output is correct
71	Correct	219 ms	21388 KB	Output is correct
72	Correct	208 ms	23748 KB	Output is correct
73	Correct	261 ms	35452 KB	Output is correct
74	Correct	192 ms	20088 KB	Output is correct
75	Correct	181 ms	21328 KB	Output is correct
76	Correct	203 ms	23632 KB	Output is correct
77	Correct	250 ms	35796 KB	Output is correct
78	Correct	205 ms	27700 KB	Output is correct
79	Correct	200 ms	27476 KB	Output is correct
80	Correct	213 ms	27932 KB	Output is correct
81	Correct	231 ms	27632 KB	Output is correct
82	Correct	168 ms	19796 KB	Output is correct
83	Correct	165 ms	20008 KB	Output is correct
84	Correct	159 ms	19792 KB	Output is correct
85	Correct	250 ms	36504 KB	Output is correct
86	Correct	258 ms	36380 KB	Output is correct
87	Correct	207 ms	28772 KB	Output is correct
88	Correct	227 ms	28784 KB	Output is correct

답안 #950406

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 40.0 / 40.0

Subtask #3 45.0 / 45.0

Subtask #1
15.0 / 15.0

Subtask #2
40.0 / 40.0

Subtask #3
45.0 / 45.0