Submission #568017

#	Time	Username	Problem	Language	Result	Execution time	Memory
568017		minhcool	코알라 (APIO17_koala)	C++17	4 / 100	5 ms	324 KiB

koala

#include "koala.h"
#include<bits/stdc++.h>
using namespace std;

//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

//const int N = ;

const int oo = 1e18 + 7, mod = 1e9 + 7;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	temp = (temp + (r - l + 1)) % (r - l + 1);
	return temp + l;
}

int n;
int B[105], R[105];

int minValue(int N, int W) {
    //int B[105], R[105];
  	for(int i = 0; i < N; i++) B[i] = 0;
  	B[0] = 1;
  	playRound(B, R);
  	//for(int i = 0; i < N; i++) cout << B[i] << " " << R[i] << "\n";
  	for(int i = 0; i < N; i++) if(R[i] <= B[i]) return i;
    //return;
}

int maxValue(int N, int W) {
    
    return 0;
}

int cnt = 0;

int greaterValue(int N, int W) {
	n = N;
	int l = 0, r = 15;
	while(l <= r){
		int mid = (l + r) >> 1;
		for(int i = 0; i < n; i++) B[i] = 0;
		B[0] = B[1] = mid;
		playRound(B, R);
		bool ck1 = (R[0] > B[0]), ck2 = (R[1] > B[1]);
		if(ck1 ^ ck2) return ck1;
		if(!ck1) r = mid - 1;
		else l = mid + 1;
	}
    return 0;
}

void allValues(int N, int W, int *P) {
    if(W == 2*N){
        
    } 
    else{
        
    }
    //return 0;
}

/*
void process(){

}

signed main(){
	ios_base::sync_with_stdio(0);
	process();
}*/

Compilation message (stderr)

koala.cpp:19:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   19 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:40:1: warning: control reaches end of non-void function [-Wreturn-type]
   40 | }
      | ^

• Subtask 1: 4 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53