oj.uz

Submission #958732

# Submission time Handle Problem Language Result Execution time Memory
958732 2024-04-06T13:13:52 Z MilosMilutinovic Koala Game (APIO17_koala) C++14
47 / 100
 79 ms 6480 KB 
#include "koala.h"
#include<bits/stdc++.h>
 
#define pb push_back
 
using namespace std;
 
int minValue(int n,int w){
	int a[n],b[n];
	for(int i=0;i<n;i++) a[i]=0;
	a[0]=1;
	playRound(a,b);
	for(int i=0;i<n;i++) if(a[i]>=b[i]) return i;
}
 
int maxValue(int n,int w){
	vector<int> c;
	for(int i=0;i<n;i++) c.pb(i);
	while((int)c.size()>1){
		int a[n],b[n];
		for(int i=0;i<n;i++) a[i]=0;
		for(int i:c) a[i]=w/(int)c.size();
		playRound(a,b);
		c.clear();
		for(int i=0;i<n;i++) if(b[i]>a[i]&&a[i]>0) c.pb(i);
	}
	return c[0];
}
 
int greaterValue(int n,int w){
	int low=1,high=min(10,w/2);
	while(low<=high){
		int mid=(low+high)/2;
		int a[n],b[n];
		for(int i=0;i<n;i++) a[i]=0;
		a[0]=a[1]=mid;
		playRound(a,b);
		if(b[0]>mid&&b[1]>mid) low=mid+1;
		else if(b[0]<=mid&&b[1]<=mid) high=mid-1;
		else return (b[0]>mid?0:1);
	}
	return 0;
}
 
void allValues(int n,int w,int *p){
	if(w==2*n){
		auto cmp=[&](int x,int y){
			int a[n],b[n];
			for(int i=0;i<n;i++) a[i]=0;
			a[x]=a[y]=w/2;
			playRound(a,b);
			return b[x]<b[y];
		};
		function<vector<int>(int,int)> solve=[&](int l,int r){
			if(l==r) return vector<int>(1,l);
			int mid=(l+r)/2;
			vector<int> vl=solve(l,mid);
			vector<int> vr=solve(mid+1,r);
			vector<int> ret;
			int i=0,j=0,x=(int)vl.size(),y=(int)vr.size();
			while(i<x||j<y){
				if(i==x||(j<y&&!cmp(vl[i],vr[j]))) ret.pb(vr[j++]);
				else ret.pb(vl[i++]);
			}
			return ret;
		};
		vector<int> res=solve(0,n-1);
		for(int i=0;i<n;i++) p[res[i]]=i+1;
	}else{
		vector<int> ids;
		for(int i=0;i<n;i++) ids.pb(i);
		function<void(vector<int>,int,int)> solve=[&](vector<int> v,int l,int r){
			if(v.size()==1) return (void)(p[v[0]]=l);
			int val=min(w/(r-l+1),(int)sqrt(2*l));
			int a[n],b[n];
			for(int i:v) a[i]=val;
			playRound(a,b);
			vector<int> x,y;
			for(int i:v){
				if(b[i]>a[i]) x.pb(i);
				else y.pb(i);
			}
			solve(x,l,l+x.size()-1);
			solve(y,r-y.size()+1,r);
		};
		solve(ids,0,n-1);
	}
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:14:1: warning: control reaches end of non-void function [-Wreturn-type]
   14 | }
      | ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 3 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 10 ms 452 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 596 KB Output is correct
2 Correct 43 ms 472 KB Output is correct
3 Correct 39 ms 460 KB Output is correct
4 Correct 46 ms 604 KB Output is correct
5 Correct 39 ms 472 KB Output is correct
6 Correct 41 ms 484 KB Output is correct
7 Correct 39 ms 468 KB Output is correct
8 Correct 40 ms 468 KB Output is correct
9 Correct 40 ms 468 KB Output is correct
10 Correct 40 ms 600 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 352 KB Output is correct
2 Correct 26 ms 344 KB Output is correct
3 Correct 25 ms 344 KB Output is correct
4 Correct 25 ms 448 KB Output is correct
5 Correct 24 ms 344 KB Output is correct
6 Correct 25 ms 444 KB Output is correct
7 Correct 24 ms 344 KB Output is correct
8 Correct 24 ms 424 KB Output is correct
9 Correct 24 ms 648 KB Output is correct
10 Correct 24 ms 344 KB Output is correct
11 Correct 25 ms 344 KB Output is correct
12 Correct 16 ms 344 KB Output is correct
13 Correct 25 ms 448 KB Output is correct
14 Correct 23 ms 344 KB Output is correct
15 Correct 27 ms 344 KB Output is correct
16 Correct 21 ms 344 KB Output is correct
17 Correct 22 ms 428 KB Output is correct
18 Correct 24 ms 344 KB Output is correct
19 Correct 25 ms 452 KB Output is correct
20 Correct 22 ms 340 KB Output is correct

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 79 ms 6480 KB Output isn't correct
2 Halted 0 ms 0 KB -