| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 410065 | dreezy | 커다란 상품 (IOI17_prize) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
/*********************************************************************************************************************/
int find_best(int n) {
int left =0,middle = n/2, right = n-1;
int numleft = 0, numright = 0;//left and right from range
int totnumleft = 0, totnumright = 0;
int curtotal = INT_MAX;
int cnt = 0;
int prevmiddle = -1;
bool goingup = true;
while(true){
int numl, numr; //left and right from query
vector<int> res = ask(middle);
numl = res[0], numr = res[1];
if(numl == 0 && numr == 0)
return middle;
if(numl + numr < curtotal){
numleft = 0, numright = 0;
curtotal = numl + numr;
//cout << "NEW TOTAL at "<<middle<< ": "<<curtotal<<endl;
left = 0, middle = n/2, right = n-1;
continue;
}
prevmiddle = -1;
numl -= numleft;
numr -= numright;
//cout <<"("<< left <<", "<<middle<<", "<<right<<")";
//cout << ":\t"<<numleft <<", "<<numright<<", "<<numl<<", "<<numr;
int lhole = (middle - left) - numl +1;
int rhole = (right - middle) - numr +1;
//cout << ";\t"<<lhole<<", "<<rhole<<endl;
if( (lhole< rhole && numl > 0) || numr == 0){
right = middle -1;
middle = middle - lhole;
numright += numr;
}
else{
left = middle + 1;
middle = middle + rhole;
numleft +=numl;
}
//if(left == right)
//middle = left;
cnt++;
if(cnt >= 10) break;
}
return 0;
}
/*********************************************************************************************************************/
static const int max_q = 10000;
static int n;
static int query_count = 0;
static vector<int> g;
static vector<vector<int> > rank_count;
vector<int> ask(int i) {
query_count++;
if(query_count > max_q) {
cerr << "Query limit exceeded" << endl;
exit(0);
}
if(i < 0 || i >= n) {
cerr << "Bad index: " << i << endl;
exit(0);
}
vector<int> res(2);
res[0] = rank_count[g[i] - 1][i + 1];
res[1] = rank_count[g[i] - 1][n] - res[0];
return res;
}
int main() {
cin >> n;
g.resize(n);
for(int i = 0; i < n; i++) {
cin >> g[i];
if(g[i] < 1) {
cerr << "Invalid rank " << g[i] << " at index " << i << endl;
exit(0);
}
}
int max_rank = *max_element(g.begin(), g.end());
rank_count.resize(max_rank + 1, vector<int>(n + 1, 0));
for(int r = 0; r <= max_rank; r++) {
for(int i = 1; i <= n; i++) {
rank_count[r][i] = rank_count[r][i - 1];
if(g[i - 1] == r)
rank_count[r][i]++;
}
}
for(int i = 0; i <= n; i++)
for(int r = 1; r <= max_rank; r++)
rank_count[r][i] += rank_count[r - 1][i];
int res = find_best(n);
cout << res << endl << "Query count: " << query_count << endl;
return 0;
}