oj.uz

Submission #15634

# Submission time Handle Problem Language Result Execution time Memory
15634 2015-07-13T13:41:02 Z gs14004 Last supper (IOI12_supper) C++14
0 / 100
 522 ms 19112 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;
}

void ComputeAdvice(int *C, int N, int K, int M) {
	for(int i=0; i<N; i++){
		nexts.push_back(pi(C[i], i));
	}
	for(int i=0; i<K; i++){
		s.insert(pi(getnxt(i, -1), i));
		is_in[i] = 1;
	}
	sort(nexts.begin(), nexts.end());
	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++){
		for(int j=0; j<17; j++){
			WriteAdvice((query[i] >> j) & 1);
		}
	}
}
#include "assistant.h"

void Assist(unsigned char *A, int N, int K, int R) {
	for(int i=0; i<R; i+=17){
		int bits = 0;
		for(int j=0; j<17; j++){
			bits |= (A[i + j] << j);
		}
		int req = GetRequest();
		if(bits == N){
			continue;
		}
		else{
			PutBack(bits);
		}
	}
}

Compilation message

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

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 680 KB Output is correct
2 Incorrect 4 ms 1152 KB Output isn't correct - not an optimal way
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 53 ms 2784 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 365 ms 15016 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 15016 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 462 ms 18176 KB Output isn't correct - not an optimal way
2 Incorrect 488 ms 18592 KB Output isn't correct - not an optimal way
3 Incorrect 494 ms 18968 KB Output isn't correct - not an optimal way
4 Incorrect 465 ms 19000 KB Output isn't correct - not an optimal way
5 Incorrect 518 ms 19080 KB Output isn't correct - not an optimal way
6 Incorrect 522 ms 19080 KB Output isn't correct - not an optimal way
7 Incorrect 481 ms 19080 KB Output isn't correct - not an optimal way
8 Incorrect 466 ms 19080 KB Output isn't correct - not an optimal way
9 Incorrect 472 ms 19112 KB Output isn't correct - not an optimal way
10 Incorrect 464 ms 19112 KB Output isn't correct - not an optimal way