oj.uz

답안 #50270

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
50270 2018-06-09T00:10:29 Z Mamnoon_Siam 커다란 상품 (IOI17_prize) C++17
0 / 100
 17 ms 10068 KB 
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

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

#define debug(s) cout<< #s <<" = "<< s <<endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a,val) memset(a, val, sizeof a)
#define PB push_back
#define endl '\n'

inline int myrand(int l, int r) {
	int ret = rand(); ret <<= 15; ret ^= rand();
	if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
	return ret;
}
template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
    return os<<"(" <<p.first<<", "<<p.second<<")";
}

const int maxn = 200010;

vector<int> memo[maxn];
int mx_tot = 0;
vector<int> blocks;

int Left(int i) {
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][0];
}
int Total(int i) {
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][0] + memo[i][1];
}
bool IsThere(int i, int j) {
	if(Total(j) < mx_tot) return true;
	return (Left(j) - Left(i)) > 0;
}
bool Thicc(int i) {
	return Total(i) < mx_tot;
}

int NextThicc(int i) {
	if(Thicc(i)) return i;
	int it = lower_bound(all(blocks), i) - blocks.begin();
	while(!IsThere(i, blocks[it])) it++;
	int d = max(blocks[it-1] + 1, i);
	for(int j = 25; j >= 0; j--) {
		if(d + (1 << j) >= blocks[it]) continue;
		if(!IsThere(i, d + (1 << j)))
			d += (1 << j);
	} return d + 1;
}

int find_best(int n) { int debug = 0;
	if(!debug) if(n <= 5000)
		for(int i = 0; i < n; i++)
			if(Total(i) == 0)
				return i;

	int k = 782; int sz = n / k;
	for(int i = 0; i < n; i += sz) {
		blocks.push_back(i);
	} if(blocks.back() != n-1) blocks.push_back(n-1);
	for(int b : blocks) mx_tot = max(mx_tot, Total(b));
	int now = 0;
	while(true) {
		now = NextThicc(now);
		if(Total(now) == 0) return now;
		now++;
	}
}

Compilation message

prize.cpp: In function 'int myrand(int, int)':
prize.cpp:17:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
  ^~
prize.cpp:17:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
                          ^~~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 4984 KB Output is correct
2 Correct 12 ms 5176 KB Output is correct
3 Correct 12 ms 5176 KB Output is correct
4 Correct 15 ms 5176 KB Output is correct
5 Correct 13 ms 5176 KB Output is correct
6 Correct 10 ms 5176 KB Output is correct
7 Correct 10 ms 5176 KB Output is correct
8 Correct 12 ms 5176 KB Output is correct
9 Correct 12 ms 5176 KB Output is correct
10 Runtime error 17 ms 10068 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 10068 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -