oj.uz

답안 #382801

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
382801 2021-03-28T08:33:06 Z alireza_kaviani 최후의 만찬 (IOI12_supper) C++11
0 / 100
 2500 ms 15676 KB 
#include <bits/stdc++.h>
#include "advisor.h"

using namespace std;

typedef pair<int, int> pii;

#define X			first
#define Y			second

const int MAXN = 2e5 + 10;
const int MOD = 1e9 + 7;

int mark[MAXN] , res[MAXN];
vector<int> vec[MAXN];
set<pii , greater<pii>> st;

void ComputeAdvice(int *C, int N, int K, int M) {
	for(int i = 0 ; i < N ; i++)	vec[i].push_back(MAXN);
	for(int i = N - 1 ; i >= 0 ; i--){
		vec[C[i]].push_back(i);
	}
	for(int i = 0 ; i < K ; i++){
		st.insert({vec[i].back() , i});
	}
	for(int i = 0 ; i < N ; i++){
		auto it = st.lower_bound({i , MOD});
		if(it != st.end() && (*it).X == i){
			res[(*it).Y] = 1;
			st.erase(it);
			vec[C[i]].pop_back();
			st.insert({vec[C[i]].back() , i + K});
		}
		else{
			vec[C[i]].pop_back();
			st.insert({vec[C[i]].back() , i + K});
			st.erase(st.begin());
		}
	}
	for(int i = 0 ; i < N + K ; i++)	WriteAdvice(res[i]);
}
#include <bits/stdc++.h>
#include "assistant.h"

using namespace std;

#define sep			' '

set<int> st0 , st1;

void Assist(unsigned char *A, int N, int K, int R) {
	for(int i = 0 ; i < K ; i++){
//		cout << i << sep << (int)A[i] << endl;
		if(A[i] == 0)	st0.insert(i);
		else	st1.insert(i);
	}
	for(int i = 0 ; i < N ; i++){
		int cur = GetRequest();
		st0.erase(cur);
		st1.erase(cur);
//		cout << i + K << sep << (int)A[i + K] << endl;
		if(st0.size() + st1.size() == K - 1){
			if(A[i + K] == 0)	st0.insert(cur);
			if(A[i + K] == 1)	st1.insert(cur);
			continue;
		}
		PutBack((*st0.begin()));
//		cout << i << ' ' << (*st0.begin()) << endl;
		st0.erase(st0.begin());
		if(A[i + K] == 0)	st0.insert(cur);
		if(A[i + K] == 1)	st1.insert(cur);
	}
}

Compilation message

assistant.cpp: In function 'void Assist(unsigned char*, int, int, int)':
assistant.cpp:21:30: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   21 |   if(st0.size() + st1.size() == K - 1){
      |      ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5496 KB Output is correct
2 Correct 5 ms 5348 KB Output is correct
3 Correct 7 ms 5488 KB Output is correct
4 Incorrect 8 ms 5856 KB Error - Putting back a color that is not on the scaffold
5 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2530 ms 6188 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 144 ms 12488 KB Output is correct
2 Correct 200 ms 15228 KB Output is correct
3 Correct 195 ms 15612 KB Output is correct
4 Correct 203 ms 15676 KB Output is correct
5 Execution timed out 2551 ms 15208 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 5796 KB Output is correct
2 Execution timed out 2581 ms 5936 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 149 ms 13924 KB Error - Putting back a color that is not on the scaffold
2 Correct 190 ms 14120 KB Output is correct - 122000 bits used
3 Correct 184 ms 14432 KB Output is correct - 125000 bits used
4 Correct 194 ms 14428 KB Output is correct - 125000 bits used
5 Correct 245 ms 14436 KB Output is correct - 125000 bits used
6 Correct 186 ms 14432 KB Output is correct - 125000 bits used
7 Correct 255 ms 14412 KB Output is correct - 124828 bits used
8 Correct 294 ms 14396 KB Output is correct - 124910 bits used
9 Correct 189 ms 14396 KB Output is correct - 125000 bits used
10 Execution timed out 2557 ms 13796 KB Time limit exceeded