답안 #73429

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
73429 2018-08-28T09:03:58 Z Sa1378 커다란 상품 (IOI17_prize) C++17
20 / 100
1000 ms 3944 KB
    #include "prize.h"
    #include <bits/stdc++.h>
    using namespace std;
    #define N ((int)201*1000)
     
    int n,arr[N],lft[N],rght[N];
    int cnt_rght[N],cnt_lft[N];
    bool mark[N];
     
    bool query(int x)
    {
    	if(lft[x]+rght[x]>0)return 0;
    	vector <int> vec;vec=ask(x);
    	lft[x]=vec[0];rght[x]=vec[1];
    	return (lft[x]+rght[x]==0);
    }
     
    void add(int x)
    {
    	mark[x]=1;
    	for(int i=x+1;i<n;i++)cnt_lft[i]++;
    	for(int i=x-1;i>=0;i--)cnt_rght[i]++;
    	return ;
    }
     
     
    int find_best(int n2)
    {
    	n=n2;
    	int now=0,id;
		queue <pair<int,int> > q;
		q.push({-1,n});
    	for(int i=0;i<300 && q.size();i++)
    	{
			int l=q.front().first,r=q.front().second;q.pop();
			if(l>=r-1)continue;
			int mid=(l+r)/2;
    		if(query(mid))return mid;
    		if(now<lft[mid]+rght[mid])
    			now=lft[mid]+rght[mid],id=mid;
			q.push({l,mid});
			q.push({mid,r});
    	}
		while(q.size())q.pop();
    	q.push({-1,n});
    	for(int i=0;i<300 && q.size();i++)
    	{
			int l=q.front().first,r=q.front().second;q.pop();
			if(l>=r-1)continue;
			int mid=(l+r)/2;
    		if(now>lft[mid]+rght[mid])
    			add(mid);
			q.push({l,mid});
			q.push({mid,r});
		}
		while(1)
    	{
    		int l=-1,r=n;
    		while(l<r-1)
    		{
    			int mid=(l+r)/2;
    			for(int i=0;;i++)
    			{
    				if(mid+i<r && !mark[mid+i])
    				{
    					mid=mid+i;
    					break;
    				}
    				if(mid-i>l && !mark[mid-i])
    				{
    					mid=mid-i;
    					break;
    				}
    			}
    			if(query(mid))return mid;
    			if(lft[mid]+rght[mid]<now)
    			{
    				add(mid);
    				break;
    			}
    			if((rght[mid]-cnt_rght[mid])-(rght[r]-cnt_rght[r])>0)l=mid;
    			else r=mid;
    		}
    	}
    	
    }

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:39:7: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
       if(now<lft[mid]+rght[mid])
       ^~
prize.cpp:41:4: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
    q.push({l,mid});
    ^
prize.cpp:51:7: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
       if(now>lft[mid]+rght[mid])
       ^~
prize.cpp:53:4: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
    q.push({l,mid});
    ^
prize.cpp:30:16: warning: variable 'id' set but not used [-Wunused-but-set-variable]
      int now=0,id;
                ^~
# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1912 KB Output is correct
2 Correct 9 ms 1916 KB Output is correct
3 Correct 8 ms 2052 KB Output is correct
4 Correct 11 ms 2052 KB Output is correct
5 Correct 10 ms 2052 KB Output is correct
6 Correct 11 ms 2052 KB Output is correct
7 Correct 5 ms 2300 KB Output is correct
8 Correct 10 ms 2300 KB Output is correct
9 Correct 3 ms 2300 KB Output is correct
10 Correct 9 ms 2300 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2300 KB Output is correct
2 Correct 7 ms 2300 KB Output is correct
3 Correct 10 ms 2300 KB Output is correct
4 Correct 12 ms 2300 KB Output is correct
5 Correct 12 ms 2300 KB Output is correct
6 Correct 11 ms 2300 KB Output is correct
7 Correct 8 ms 2300 KB Output is correct
8 Correct 12 ms 2300 KB Output is correct
9 Correct 2 ms 2300 KB Output is correct
10 Correct 9 ms 2300 KB Output is correct
11 Correct 17 ms 3388 KB Output is correct
12 Correct 19 ms 3760 KB Output is correct
13 Correct 14 ms 3760 KB Output is correct
14 Correct 16 ms 3760 KB Output is correct
15 Correct 118 ms 3760 KB Output is correct
16 Correct 42 ms 3760 KB Output is correct
17 Correct 83 ms 3904 KB Output is correct
18 Correct 12 ms 3904 KB Output is correct
19 Correct 150 ms 3932 KB Output is correct
20 Correct 45 ms 3932 KB Output is correct
21 Correct 82 ms 3932 KB Output is correct
22 Correct 95 ms 3932 KB Output is correct
23 Correct 14 ms 3932 KB Output is correct
24 Correct 20 ms 3932 KB Output is correct
25 Correct 57 ms 3932 KB Output is correct
26 Correct 84 ms 3932 KB Output is correct
27 Correct 9 ms 3932 KB Output is correct
28 Correct 18 ms 3932 KB Output is correct
29 Correct 17 ms 3932 KB Output is correct
30 Correct 11 ms 3932 KB Output is correct
31 Correct 157 ms 3932 KB Output is correct
32 Correct 9 ms 3932 KB Output is correct
33 Correct 5 ms 3932 KB Output is correct
34 Correct 95 ms 3932 KB Output is correct
35 Correct 11 ms 3932 KB Output is correct
36 Correct 114 ms 3932 KB Output is correct
37 Correct 25 ms 3932 KB Output is correct
38 Correct 16 ms 3932 KB Output is correct
39 Correct 99 ms 3932 KB Output is correct
40 Correct 11 ms 3932 KB Output is correct
41 Correct 80 ms 3932 KB Output is correct
42 Correct 102 ms 3932 KB Output is correct
43 Correct 83 ms 3932 KB Output is correct
44 Correct 70 ms 3932 KB Output is correct
45 Correct 79 ms 3932 KB Output is correct
46 Correct 158 ms 3932 KB Output is correct
47 Correct 69 ms 3932 KB Output is correct
48 Correct 49 ms 3932 KB Output is correct
49 Correct 141 ms 3932 KB Output is correct
50 Correct 7 ms 3932 KB Output is correct
51 Correct 77 ms 3932 KB Output is correct
52 Correct 130 ms 3932 KB Output is correct
53 Correct 6 ms 3932 KB Output is correct
54 Correct 76 ms 3932 KB Output is correct
55 Correct 105 ms 3932 KB Output is correct
56 Correct 10 ms 3932 KB Output is correct
57 Correct 66 ms 3932 KB Output is correct
58 Correct 63 ms 3932 KB Output is correct
59 Correct 58 ms 3932 KB Output is correct
60 Correct 113 ms 3932 KB Output is correct
61 Correct 7 ms 3932 KB Output is correct
62 Correct 10 ms 3932 KB Output is correct
63 Correct 10 ms 3932 KB Output is correct
64 Correct 10 ms 3932 KB Output is correct
65 Correct 9 ms 3932 KB Output is correct
66 Correct 122 ms 3932 KB Output is correct
67 Correct 85 ms 3932 KB Output is correct
68 Correct 34 ms 3932 KB Output is correct
69 Correct 114 ms 3932 KB Output is correct
70 Correct 49 ms 3932 KB Output is correct
71 Correct 164 ms 3932 KB Output is correct
72 Correct 21 ms 3932 KB Output is correct
73 Correct 110 ms 3932 KB Output is correct
74 Correct 145 ms 3932 KB Output is correct
75 Correct 12 ms 3932 KB Output is correct
76 Correct 80 ms 3932 KB Output is correct
77 Correct 142 ms 3932 KB Output is correct
78 Correct 27 ms 3932 KB Output is correct
79 Correct 65 ms 3932 KB Output is correct
80 Correct 192 ms 3932 KB Output is correct
81 Correct 122 ms 3932 KB Output is correct
82 Correct 163 ms 3944 KB Output is correct
83 Correct 15 ms 3944 KB Output is correct
84 Correct 137 ms 3944 KB Output is correct
85 Correct 146 ms 3944 KB Output is correct
86 Correct 89 ms 3944 KB Output is correct
87 Correct 20 ms 3944 KB Output is correct
88 Correct 94 ms 3944 KB Output is correct
89 Correct 93 ms 3944 KB Output is correct
90 Correct 14 ms 3944 KB Output is correct
91 Correct 52 ms 3944 KB Output is correct
92 Correct 94 ms 3944 KB Output is correct
93 Execution timed out 1070 ms 3944 KB Time limit exceeded
94 Halted 0 ms 0 KB -