//Never stop trying
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#ifndef LOCAL
#include "koala.h"
#endif
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up
template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
return a + rng() % (b - a + 1);
}
#ifndef LOCAL
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl;
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;
void IO() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int P[100];
int N,W;
#ifdef LOCAL
void playRound(int *B, int *R) {
int i, j;
int S = 0;
for (i=0;i<N;++i) {
if ( !(B[i] >= 0 && B[i] <= W) ) {
printf("Invalid query.\n");
exit(0);
}
S += B[i];
}
if (S > W) {
printf("Invalid query.\n");
exit(0);
}
/*numQueries++;
if (numQueries > maxQueries) {
printf("Too many queries.\n");
exit(0);
}*/
int cache[2][205];
int num[2][205];
char taken[105][205];
for (i=0;i<205;++i) {
cache[1][i] = 0;
num[1][i] = 0;
}
for (i=0;i<N;++i) {
int v = B[i]+1;
int ii = i&1;
int o = ii^1;
for (j=0;j<=W;++j) {
cache[ii][j] = cache[o][j];
num[ii][j] = num[o][j];
taken[i][j] = 0;
}
for (j=W;j>=v;--j) {
int h = cache[o][j-v] + P[i];
int hn = num[o][j-v] + 1;
if (h > cache[ii][j] || (h == cache[ii][j] && hn > num[ii][j])) {
cache[ii][j] = h;
num[ii][j] = hn;
taken[i][j] = 1;
} else {
taken[i][j] = 0;
}
}
}
int cur = W;
for (i=N-1;i>=0;--i) {
R[i] = taken[i][cur] ? (B[i] + 1) : 0;
cur -= R[i];
}
}
#endif
int B[100],R[100];
int minValue(int NN, int WW) {
N=NN; W=WW;
fill(B,B+N,0);
B[0]=1;
playRound(B,R);
FOR(i,0,N) if(R[i]==0) return i;
return 0;
}
int maxValue(int NN, int WW) {
N=NN; W=WW;
vi v; FOR(i,0,N) v.pb(i);
while(sz(v)>1){
int k=W/sz(v);
fill(B,B+N,0);
for(auto i: v) B[i]=k;
playRound(B,R);
v.clear();
FOR(i,0,N) if(R[i]>k) v.pb(i);
}
return v[0];
}
int greaterValue(int NN, int WW) {
N=NN; W=WW;
int l=1,r=9;
while(l<=r){
int m=(l+r)/2;
fill(B,B+N,0);
B[0]=m; B[1]=m;
playRound(B,R);
if(R[0]>m && R[1]>m) l=m+1;
else if(R[0]<=m && R[1]<=m) r=m-1;
else return (R[0]<R[1]);
}
return 0;
}
void allValues(int NN, int WW, int *PP){
}
#ifdef LOCAL
int main() {
boost; IO();
FOR(i,0,100) P[i]=i+1;
//cout << maxValue(100,100) << endl;
P[0]=99; P[1]=100; P[99]=1; P[98]=2;
cout << greaterValue(100,100) << endl;
return 0;
}
#endif
/* Careful!!!
.Array bounds
.Infinite loops
.Uninitialized variables / empty containers
.Multisets are shit
Some insights:
.Binary search
.Graph representation
.Write brute force code
.Change your approach
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
364 KB |
Output is correct |
| 2 |
Correct |
6 ms |
364 KB |
Output is correct |
| 3 |
Correct |
6 ms |
364 KB |
Output is correct |
| 4 |
Correct |
5 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
18 ms |
364 KB |
Output is correct |
| 2 |
Correct |
18 ms |
364 KB |
Output is correct |
| 3 |
Correct |
19 ms |
528 KB |
Output is correct |
| 4 |
Correct |
18 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
74 ms |
484 KB |
Output is correct |
| 2 |
Correct |
88 ms |
364 KB |
Output is correct |
| 3 |
Correct |
71 ms |
364 KB |
Output is correct |
| 4 |
Correct |
72 ms |
364 KB |
Output is correct |
| 5 |
Correct |
72 ms |
364 KB |
Output is correct |
| 6 |
Correct |
74 ms |
364 KB |
Output is correct |
| 7 |
Correct |
73 ms |
408 KB |
Output is correct |
| 8 |
Correct |
73 ms |
364 KB |
Output is correct |
| 9 |
Correct |
72 ms |
364 KB |
Output is correct |
| 10 |
Correct |
70 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
