oj.uz

답안 #1017897

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1017897 2024-07-09T11:13:34 Z NintsiChkhaidze 최후의 만찬 (IOI12_supper) C++17
0 / 100
 128 ms 193040 KB 
#include <bits/stdc++.h>
#include "advisor.h"
using namespace std;

void ComputeAdvice(int *C, int N, int K, int M) {

	for (int i=0;i<N;i++){
		int x = C[i];
		for (int j = 20; j >= 0; j--){
			if (((x >> j) & 1)) WriteAdvice(1);
			else WriteAdvice(0);
		}
	}
	
}

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

const int MM = 2e6 + 5;
int CC[MM];
bool on[MM];
set <int> st[MM];
void Assist(unsigned char *A, int N, int K, int R) {
	
	int id=0;
	for (int i = 0; i < R; i += 20){
		for (int j = i; j <= i + 19; j++){
			if (A[j] == 1) CC[id] |= (1<<(12-(j-i)));
		}
		id+=1;
	}
	
	/*
	cout<<"Here"<<endl;
	for (int i=0;i<id;i++)
		cout<<CC[i]<<" ";
	cout<<endl;*/
	
	for (int i=id-1;i>=0;i--){
		st[CC[i]].insert(i);
	}
	
	for (int i=0;i<K;i++)
		on[i]=1;
	
	int i;
	for (i = 0; i < N; i++) {
    	int req = GetRequest();
    	if (on[req]) continue;
    	
		int mx=-1,idx=-1;
    	for (int j=0;j<N;j++){
    		if (!on[j]) continue;
    		
    		while (st[j].size() && *st[j].begin() < i){
    			st[j].erase(st[j].begin());
			}
			
			if (!st[j].size()){
    			idx=j;
    			break;
			}
			
			int y = *st[j].begin();
			if (y > mx){
				mx = y;
				idx = j;
			}
		}
		
		PutBack(idx);
		on[idx] = 0;
		on[req] = 1;
  	}
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 99 ms 191220 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 128 ms 193040 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 43 ms 96408 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 32 ms 94688 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 43 ms 96532 KB Error - advice is too long
2 Incorrect 50 ms 96804 KB Error - advice is too long
3 Incorrect 47 ms 96800 KB Error - advice is too long
4 Incorrect 44 ms 96788 KB Error - advice is too long
5 Incorrect 44 ms 96856 KB Error - advice is too long
6 Incorrect 50 ms 96564 KB Error - advice is too long
7 Incorrect 45 ms 96836 KB Error - advice is too long
8 Incorrect 45 ms 96696 KB Error - advice is too long
9 Incorrect 46 ms 96932 KB Error - advice is too long
10 Incorrect 50 ms 96716 KB Error - advice is too long