QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#409406#677. Koala GameAbdelmagedNour#Compile Error//C++201.7kb2024-05-12 01:13:332024-05-12 01:13:33

Judging History

This is the latest submission verdict.

  • [2024-05-12 01:13:33]
  • Judged
Show
  • [2024-05-12 01:13:33]
  • Submitted

answer

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
#include "koala.h"

int minValue(int N,int W){
	int B[N],R[N];
	for(int i=0;i<N;i++)B[i]=1;
	playRound(B,R);
	int win=0;
	while(R[win]<=B[win])win++;
	memset(B,0,sizeof(B));
	B[win]=1;
	playRound(B,R);
	return find(R,R+N,0)-R;
}

int maxValue(int N, int W) {
	int B[N],R[N];
	vector<int>v;
	for(int i=0;i<N;i++)v.push_back(i);
	while(v.size()!=1){
		int sz=v.size(),d=W/sz;
		memset(B,0,sizeof(B));
		for(auto i:v)B[i]=d;
		playRound(B,R);
		vector<int>nw;
		for(auto i:v){
			if(R[i]>d)nw.push_back(i);
		}
		swap(v,nw);
	}
	return v[0];
}

int greaterValue(int N, int W){
	int B[N]={},R[N]={};
	int l=1,r=9;
	while(l!=r){
		int md=(l+r)>>1;
		B[0]=B[1]=md;
		playRound(B,R);
		if(R[0]>md&&R[1]>md)l=md+1;
		else if(R[0]<=md&&R[1]<=md)r=md-1;
		else return (R[0]<R[1]);
	}
	B[0]=B[1]=l;
	playRound(B,R);
	return (R[0]<R[1]);
}
bool cmp1(int i,int j,int N){
	int B[N],R[N];
	memset(B,0,sizeof(B));
	B[i]=B[j]=100;
	playRound(B,R);
	return R[j]>100;
}
bool cmp2(int i,int j,int N){
	int B[N]={},R[N]={};
	int l=1,r=9;
	while(l!=r){
		int md=(l+r)>>1;
		B[i]=B[j]=md;
		playRound(B,R);
		if(R[i]>md&&R[j]>md)l=md+1;
		else if(R[i]<=md&&R[j]<=md)r=md-1;
		else return (R[i]<R[j]);
	}
	B[i]=B[j]=l;
	playRound(B,R);
	return (R[i]<R[j]);
}
void allValues(int N, int W, int *P) {
	if(W==2*N){
		int order[N];
		iota(order,order+N,0);
		sort(order,order+N,cmp1);
		for(int i=0;i<N;i++)P[order[i]]=i+1;
	}else{
		int order[N];
		iota(order,order+N,0);
		sort(order,order+N,cmp2);
		for(int i=0;i<N;i++)P[order[i]]=i+1;
	}
}
Source code, Language: C++20

Details 

implementer.cpp: In function ‘void grader()’:
implementer.cpp:138:11: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  138 |     fscanf(fin, "%d %d %d",&F,&G,&maxQueries);
      |     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
implementer.cpp: In function ‘void runGame(int)’:
implementer.cpp:89:11: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   89 |     fscanf(fin,"%d %d",&N,&W);
      |     ~~~~~~^~~~~~~~~~~~~~~~~~~
implementer.cpp:91:15: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   91 |         fscanf(fin,"%d",&P[i]);
      |         ~~~~~~^~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/bits/stl_algobase.h:71,
                 from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from answer.code:1:
/usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘constexpr bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = int*; _Iterator2 = int*; _Compare = bool (*)(int, int, int)]’:
/usr/include/c++/13/bits/stl_algo.h:1819:14:   required from ‘constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(int, int, int)>]’
/usr/include/c++/13/bits/stl_algo.h:1859:25:   required from ‘constexpr void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(int, int, int)>]’
/usr/include/c++/13/bits/stl_algo.h:1950:31:   required from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(int, int, int)>]’
/usr/include/c++/13/bits/stl_algo.h:4894:18:   required from ‘constexpr void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*; _Compare = bool (*)(int, int, int)]’
answer.code:78:7:   required from here
/usr/include/c++/13/bits/predefined_ops.h:158:30: error: too few arguments to function
  158 |         { return bool(_M_comp(*__it1, *__it2)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘constexpr bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = int; _Iterator = int*; _Compare = bool (*)(int, int, int)]’:
/usr/include/c++/13/bits/stl_algo.h:1799:20:   required from ‘constexpr void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(int, int, int)>]’
/usr/include/c++/13/bits/stl_algo.h:1827:36:   required from ‘constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(int, int, int)>]’
/usr/include/c++/13/bits/stl_algo.h:1859:25:   required from ‘constexpr void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(int, int, int)>]’
/usr/include/c++/13/bits/stl_algo.h:1950:31:   required from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(int, int, int)>]’
/usr/include/c++/13/bits/stl_algo.h:4894:18:   required from ‘constexpr void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*; _Compare = bool (*)(int, int, int)]’
answer.code:78:7:   required from here
/usr/include/c++/13/bits/predefined_ops.h:240:30: error: too few arguments to function
  240 |         { return bool(_M_comp(__val, *__it)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~
/usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = int*; _Value = int; _Compare = bool (*)(int, int, int)]’:
/usr/include/c++/13/bits/stl_heap.h:140:48:   required from ‘constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = int*; _Distance = long int; _Tp = int; _Compare = __gnu_cxx::__ops::_Iter_comp_val<bool (*)(int, int, int)>]’
/usr/include/c++/13/bits/stl_heap.h:247:23:   required from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = int*; _Distance = long int; _Tp = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(int, int, int)>]’...
English 繁體中文 简体中文

Server Time: 2025-02-08 22:09:11 | OpenSource Project