oj.uz

Submission #15648

# Submission time Handle Problem Language Result Execution time Memory
15648 2015-07-14T02:29:28 Z gs14004 Last supper (IOI12_supper) C++14
91 / 100
 240 ms 10696 KB 
#include "advisor.h"
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
typedef pair<int,int> pi;

set<pi> s;
vector<pi> nexts;
int query[100005];
int is_in[100005];

int getnxt(int val, int time){
	auto t = upper_bound(nexts.begin(), nexts.end(), pi(val, time));
	if(t->first != val) return 1e9;
	return t->second;
}

bool PopPrevRequest[100005];
bool PopK[25005];

void ComputeAdvice(int *C, int N, int K, int M) {
	for(int i=0; i<N; i++){
		nexts.push_back(pi(C[i], i));
	}
	sort(nexts.begin(), nexts.end());
	for(int i=0; i<K; i++){
		s.insert(pi(getnxt(i, -1), i));
		is_in[i] = 1;
	}
	for(int i=0; i<N; i++){
		query[i] = N;
		if(is_in[C[i]]){
			if(s.find(pi(i, C[i])) != s.end()) s.erase(pi(i, C[i]));
			s.insert(pi(getnxt(C[i], i), C[i]));	
		}
		else{
			auto t = --s.end();
			query[i] = t->second;
			is_in[t->second] = 0;
			s.erase(t);
			s.insert(pi(getnxt(C[i], i), C[i]));
			is_in[C[i]] = 1;
		}
	}
	for(int i=0; i<N; i++){
		if(query[i] != N){
			auto t = lower_bound(nexts.begin(), nexts.end(), pi(query[i], i));
			if(t == nexts.begin() || (t-1)->first != query[i]){
				PopK[query[i]] = 1;
			}
			else{
				t--;
				PopPrevRequest[t->second] = 1;
			}
			// investigate last use of pop query
		}
	}
	for(int i=0; i<N; i++){
		WriteAdvice(PopPrevRequest[i]);
	}
	for(int i=0; i<K; i++){
		WriteAdvice(PopK[i]);
	}
}

#include "assistant.h"
#include <set>
#include <vector>
using namespace std;
vector<int> pops;
set<int> scaffold;

void Assist(unsigned char *A, int N, int K, int R) {
	int prevReq = -1;
	for(int i=0; i<K; i++){
		scaffold.insert(i);
		if(A[i+N]) pops.push_back(i);
	}
	for(int i=0; i<N; i++){
		int curReq = GetRequest();
		if(scaffold.find(curReq) == scaffold.end()){
			PutBack(pops.back());
			scaffold.erase(pops.back());
			pops.pop_back();
			scaffold.insert(curReq);
		}
		if(A[i]){
			pops.push_back(curReq);
		}
	}
}

Compilation message

assistant.cpp: In function 'void Assist(unsigned char*, int, int, int)':
assistant.cpp:9:6: warning: unused variable 'prevReq' [-Wunused-variable]
  int prevReq = -1;
      ^~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 856 KB Output is correct
2 Correct 4 ms 1352 KB Output is correct
3 Correct 5 ms 1472 KB Output is correct
4 Correct 7 ms 1584 KB Output is correct
5 Correct 8 ms 1640 KB Output is correct
6 Correct 9 ms 1696 KB Output is correct
7 Correct 9 ms 1728 KB Output is correct
8 Correct 10 ms 1728 KB Output is correct
9 Correct 13 ms 1728 KB Output is correct
10 Correct 11 ms 1760 KB Output is correct
11 Correct 10 ms 1760 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2272 KB Output is correct
2 Correct 84 ms 4816 KB Output is correct
3 Incorrect 167 ms 10696 KB Error - Putting back a color that is not on the scaffold
4 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 10696 KB Output is correct
2 Correct 205 ms 10696 KB Output is correct
3 Correct 213 ms 10696 KB Output is correct
4 Correct 213 ms 10696 KB Output is correct
5 Correct 204 ms 10696 KB Output is correct
6 Correct 226 ms 10696 KB Output is correct
7 Correct 227 ms 10696 KB Output is correct
8 Correct 240 ms 10696 KB Output is correct
9 Correct 190 ms 10696 KB Output is correct
10 Correct 224 ms 10696 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 10696 KB Output is correct
2 Correct 10 ms 10696 KB Output is correct
3 Correct 10 ms 10696 KB Output is correct
4 Correct 9 ms 10696 KB Output is correct
5 Correct 9 ms 10696 KB Output is correct
6 Correct 15 ms 10696 KB Output is correct
7 Correct 13 ms 10696 KB Output is correct
8 Correct 10 ms 10696 KB Output is correct
9 Correct 12 ms 10696 KB Output is correct
10 Correct 13 ms 10696 KB Output is correct

Subtask #5
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 10696 KB Output is correct - 120000 bits used
2 Correct 203 ms 10696 KB Output is correct - 122000 bits used
3 Correct 206 ms 10696 KB Output is correct - 125000 bits used
4 Correct 206 ms 10696 KB Output is correct - 125000 bits used
5 Correct 204 ms 10696 KB Output is correct - 125000 bits used
6 Correct 207 ms 10696 KB Output is correct - 125000 bits used
7 Correct 204 ms 10696 KB Output is correct - 124828 bits used
8 Correct 207 ms 10696 KB Output is correct - 124910 bits used
9 Correct 238 ms 10696 KB Output is correct - 125000 bits used
10 Correct 193 ms 10696 KB Output is correct - 125000 bits used