oj.uz

답안 #715934

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
715934 2023-03-28T13:30:07 Z myrcella 커다란 상품 (IOI17_prize) C++17
20 / 100
 96 ms 336 KB 
//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 ll long long
#define mod 1000000007
#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 "prize.h"

int ans;

void solve(int l,int r) {
	if (l>r) return;
	int mid = l+r>>1;
	vector <int> tmp = ask(mid);
	if (tmp[0]+tmp[1]==0) {
		ans = mid;
		return;
	}
	if (tmp[0]>0) solve(l,mid-1);
	if (tmp[1]>0) solve(mid+1,r);
	return;
}

int find_best(int n) {
	solve(0,n-1);
	return ans;
}

Compilation message

prize.cpp: In function 'void solve(int, int)':
prize.cpp:29:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   29 |  int mid = l+r>>1;
      |            ~^~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 292 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 272 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 292 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 288 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 208 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 268 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 288 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 216 KB Output is correct
11 Incorrect 96 ms 292 KB Incorrect
12 Halted 0 ms 0 KB -