oj.uz

답안 #70093

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
70093 2018-08-22T10:35:02 Z E869120 커다란 상품 (IOI17_prize) C++14
20 / 100
 102 ms 2476 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

vector<int>vec;int N,Query=0;

pair<int,int> asks(int p){
	Query++;assert(0<=p && p<N);
	vector<int>Z = ask(p);
	return make_pair(Z[0],Z[1]);
}

int find_best(int n) {
	srand((unsigned)time(NULL));
	N=n;
	vector<int>vec;for(int i=0;i<n;i++) vec.push_back(i);
	
	while(vec.size()>=2){
		int minx=0;
		if(vec.size()>=100){
			for(int i=0;i<5;i++){
				pair<int,int>A=asks(vec[rand()%vec.size()]);
				minx=max(minx,A.first+A.second);
			}
		}
		else{
			for(int i=0;i<vec.size();i++){
				pair<int,int>A=asks(vec[i]);
				minx=max(minx,A.first+A.second);
			}
		}
		
		int s = 0;for(int i=0;i<20;i++){if((1<<i)<=vec.size()) s=i+1;}
		int cnt=0,ret=-1;vector<int>vec2;
		while(true){
			int c = 0;
			for(int i=s-1;i>=0;i--){
				int pos = vec[min(c + (1<<i), (int)vec.size() - 1)];
				if(pos <= ret) c += (1<<i);
				else{
					pair<int,int>Z = asks(pos);
					if(Z.first+Z.second==minx && Z.first<=cnt) c+=(1<<i);
				}
			}
			if(c==(1<<s)-1){
				break;
			}
			else{
				// results = vec[c + 1]
				if(c == 0 && ret == -1){
					int pos = vec[0];
					pair<int, int> Z = asks(pos);
					if(Z.first + Z.second != minx) c = -1;
				}
				vec2.push_back(vec[c + 1]);
				ret = vec[c + 1];
			}
			cnt++;
		}
		vec=vec2;
	}
	pair<int, int>Z = asks(vec[0]);
	assert(Z.first + Z.second == 0);
	return vec[0];
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:27:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i=0;i<vec.size();i++){
                ~^~~~~~~~~~~
prize.cpp:33:44: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   int s = 0;for(int i=0;i<20;i++){if((1<<i)<=vec.size()) s=i+1;}
                                      ~~~~~~^~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1516 KB Output is correct
2 Correct 5 ms 1516 KB Output is correct
3 Correct 5 ms 1532 KB Output is correct
4 Correct 4 ms 1620 KB Output is correct
5 Correct 5 ms 1636 KB Output is correct
6 Correct 5 ms 1704 KB Output is correct
7 Correct 6 ms 1716 KB Output is correct
8 Correct 5 ms 1716 KB Output is correct
9 Correct 6 ms 1716 KB Output is correct
10 Correct 4 ms 1716 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1716 KB Output is correct
2 Correct 5 ms 1716 KB Output is correct
3 Correct 5 ms 1716 KB Output is correct
4 Correct 6 ms 1716 KB Output is correct
5 Correct 5 ms 1716 KB Output is correct
6 Correct 5 ms 1716 KB Output is correct
7 Correct 6 ms 1716 KB Output is correct
8 Correct 5 ms 1716 KB Output is correct
9 Correct 6 ms 1720 KB Output is correct
10 Correct 4 ms 1720 KB Output is correct
11 Correct 7 ms 1720 KB Output is correct
12 Correct 13 ms 1720 KB Output is correct
13 Correct 9 ms 1720 KB Output is correct
14 Correct 10 ms 1720 KB Output is correct
15 Partially correct 83 ms 1720 KB Partially correct - number of queries: 6624
16 Partially correct 95 ms 1720 KB Partially correct - number of queries: 7197
17 Partially correct 37 ms 1720 KB Partially correct - number of queries: 7206
18 Partially correct 61 ms 1720 KB Partially correct - number of queries: 7194
19 Partially correct 57 ms 1720 KB Partially correct - number of queries: 6747
20 Correct 61 ms 1720 KB Output is correct
21 Partially correct 61 ms 1720 KB Partially correct - number of queries: 7092
22 Partially correct 60 ms 1720 KB Partially correct - number of queries: 5289
23 Correct 8 ms 1720 KB Output is correct
24 Correct 12 ms 1720 KB Output is correct
25 Partially correct 79 ms 1720 KB Partially correct - number of queries: 6993
26 Partially correct 92 ms 1720 KB Partially correct - number of queries: 6985
27 Correct 6 ms 1720 KB Output is correct
28 Partially correct 74 ms 1720 KB Partially correct - number of queries: 6856
29 Partially correct 60 ms 1720 KB Partially correct - number of queries: 5739
30 Partially correct 73 ms 1720 KB Partially correct - number of queries: 7090
31 Partially correct 102 ms 1720 KB Partially correct - number of queries: 7109
32 Correct 15 ms 1720 KB Output is correct
33 Correct 4 ms 1720 KB Output is correct
34 Partially correct 64 ms 1720 KB Partially correct - number of queries: 7213
35 Correct 7 ms 1720 KB Output is correct
36 Partially correct 68 ms 1720 KB Partially correct - number of queries: 7135
37 Correct 10 ms 1720 KB Output is correct
38 Correct 6 ms 1720 KB Output is correct
39 Partially correct 77 ms 1720 KB Partially correct - number of queries: 7106
40 Partially correct 55 ms 1720 KB Partially correct - number of queries: 6052
41 Partially correct 84 ms 1720 KB Partially correct - number of queries: 7223
42 Partially correct 57 ms 1720 KB Partially correct - number of queries: 7223
43 Partially correct 59 ms 1720 KB Partially correct - number of queries: 6998
44 Partially correct 62 ms 1720 KB Partially correct - number of queries: 7218
45 Partially correct 66 ms 1720 KB Partially correct - number of queries: 6995
46 Partially correct 67 ms 1720 KB Partially correct - number of queries: 7204
47 Partially correct 75 ms 1720 KB Partially correct - number of queries: 7031
48 Partially correct 100 ms 1720 KB Partially correct - number of queries: 7207
49 Partially correct 28 ms 1720 KB Partially correct - number of queries: 7209
50 Partially correct 86 ms 1720 KB Partially correct - number of queries: 7194
51 Partially correct 56 ms 1720 KB Partially correct - number of queries: 7220
52 Partially correct 64 ms 1720 KB Partially correct - number of queries: 7203
53 Correct 7 ms 1720 KB Output is correct
54 Partially correct 71 ms 1720 KB Partially correct - number of queries: 7095
55 Partially correct 89 ms 1720 KB Partially correct - number of queries: 7202
56 Partially correct 65 ms 1720 KB Partially correct - number of queries: 7195
57 Partially correct 57 ms 1720 KB Partially correct - number of queries: 7110
58 Partially correct 82 ms 1720 KB Partially correct - number of queries: 7204
59 Partially correct 77 ms 1720 KB Partially correct - number of queries: 7223
60 Partially correct 86 ms 1720 KB Partially correct - number of queries: 7097
61 Correct 5 ms 1720 KB Output is correct
62 Correct 5 ms 1720 KB Output is correct
63 Correct 6 ms 1720 KB Output is correct
64 Correct 6 ms 1720 KB Output is correct
65 Correct 11 ms 1720 KB Output is correct
66 Correct 44 ms 1720 KB Output is correct
67 Correct 45 ms 1720 KB Output is correct
68 Partially correct 57 ms 1720 KB Partially correct - number of queries: 6180
69 Correct 46 ms 1720 KB Output is correct
70 Correct 23 ms 1720 KB Output is correct
71 Partially correct 76 ms 1720 KB Partially correct - number of queries: 7011
72 Correct 7 ms 1720 KB Output is correct
73 Partially correct 69 ms 1720 KB Partially correct - number of queries: 6892
74 Partially correct 61 ms 1720 KB Partially correct - number of queries: 6924
75 Correct 7 ms 1720 KB Output is correct
76 Partially correct 60 ms 1720 KB Partially correct - number of queries: 6057
77 Partially correct 59 ms 1720 KB Partially correct - number of queries: 7101
78 Correct 14 ms 1720 KB Output is correct
79 Correct 40 ms 1720 KB Output is correct
80 Partially correct 92 ms 1720 KB Partially correct - number of queries: 7106
81 Partially correct 60 ms 1720 KB Partially correct - number of queries: 7105
82 Partially correct 30 ms 1720 KB Partially correct - number of queries: 6983
83 Correct 6 ms 1720 KB Output is correct
84 Partially correct 58 ms 1720 KB Partially correct - number of queries: 5895
85 Partially correct 68 ms 1720 KB Partially correct - number of queries: 7104
86 Runtime error 15 ms 2476 KB Execution killed with signal 11 (could be triggered by violating memory limits)
87 Halted 0 ms 0 KB -