제출 #744143

#제출 시각아이디문제언어결과실행 시간메모리
744143myrcellaA Difficult(y) Choice (BOI21_books)C++17
컴파일 에러
0 ms0 KiB
//by szh #include<bits/stdc++.h> using namespace std; #define fi first #define se second #define pii pair<int,int> #define pll pair<long long,long long> #define pb push_back #define debug(x) cerr<<#x<<"="<<x<<endl #define pq priority_queue #define inf 0x3f #define rep(i,a,b) for (int i=a;i<(b);i++) #define MP make_pair #define SZ(x) (int(x.size())) #define mod 1000000007 typedef long long ll; #define ALL(x) x.begin(),x.end() void inc(int &a,int b) {a=(a+b)%mod;} void dec(int &a,int b) {a=(a-b+mod)%mod;} int lowbit(int x) {return x&(-x);} ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;} #include "books.h" const int maxn = 1e5+10; ll dif[maxn]; ll AA; int KK; ll check(int pos) { ll ret = 0; rep(i,pos-KK+1,pos+1) { if (dif[i]==-1) dif[i] = skim(i); ret += dif[i]; ret = min(ret,2*AA+319); if ((pos-i)*dif[i] > 2*A or ret + (pos-i)*dif[i] > 2*A) return 2*AA+319; } return ret; } void solve(int N, int K, long long A, int S) { AA = A; KK = K; memset(dif,-1,sizeof(dif)); // TODO implement this function if (S==N) { rep(i,1,N+1) dif[i] = skim(i); ll sum = 0; rep(i,1,K+1) { sum += dif[i]; if (sum>2*A) impossible(); } vector <int> ret; if (sum>=A) { rep(i,1,K+1) ret.pb(i); answer(ret); } rep(i,K+1,N+1) { sum += dif[i]; sum -= dif[i-K]; if (sum>2*A) { if (dif[i]>2*A) impossible(); ll sum1 = 0; rep(j,1,K) ret.pb(j),sum1 += dif[j]; ret.pb(i);sum1+=dif[i]; if (sum1<=2*A) answer(ret); impossible(); } if (sum>=A) { rep(j,i-K+1,i+1) ret.pb(j); answer(ret); } } impossible(); } int l = K, r = N; vector <int> ret; while (l<r) { int mid=l+r>>1; ll tmp = check(mid); if (tmp>2*A) r = mid; else l = mid+1; } if (l!=K and check(l-1) >= A) { rep(j,l-K,l) ret.pb(j); answer(ret); } if (dif[l]==-1) dif[l] = skim(l); if (dif[l]>=2*A) impossible(); if (check(l) < A) impossible(); ll tmp = 0; rep(i,1,K) { if (dif[i]==-1) dif[i] = skim(i),ret.pb(i); tmp += dif[i]; } if (tmp + dif[l] >= A and tmp + dif[l] <= 2*A) { ret.pb(l); answer(ret); } impossible(); }

컴파일 시 표준 에러 (stderr) 메시지

books.cpp: In function 'll check(int)':
books.cpp:37:26: error: 'A' was not declared in this scope
   37 |   if ((pos-i)*dif[i] > 2*A or ret + (pos-i)*dif[i] > 2*A) return 2*AA+319;
      |                          ^
books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:79:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   79 |   int mid=l+r>>1;
      |           ~^~