oj.uz

답안 #774436

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
774436 2023-07-05T17:57:45 Z lollipop 최후의 만찬 (IOI12_supper) C++17
100 / 100
 234 ms 143564 KB 
#include "advisor.h"
#include <vector>
#include <queue>
#include <set>
#include <cstdio>
 
using namespace std;
const int maxn = 2e5+10;
 
bool sol[maxn];
vector< int > v;
queue< int > q[maxn];
int las[maxn];
 
void ComputeAdvice(int *C, int N, int K, int M) {
	for (int i = 0; i < K; i++) v.push_back(i);
	for (int i = 0; i < N; i++) v.push_back(C[i]);
	
	for (int i = 0; i < v.size(); i++) {
		q[v[i]].push(i);
	}
	for (int i = 0; i < N; i++) q[i].push(v.size() + 1);
	
	set< pair<int, int> > s;
	for (int i = 0; i < K; i++) s.insert({-q[i].front(), i});
	for (int i = 0; i < v.size(); i++) sol[i] = false;
	for (int i = 0; i < N; i++) las[i] = N + K;
	for (int i = 0; i < v.size(); i++) {
		int x = v[i];
		if (!s.count({-q[x].front(), x})) {
			int tr = s.begin()->second;
			s.erase(s.begin());
			q[x].pop();
			s.insert({-q[x].front(), x});
		} else {
			//printf("inside %d\n", x); fflush(stdout);
			sol[las[x]] = true;
			s.erase({-q[x].front(), x});
			q[x].pop();
			s.insert({-q[x].front(), x});
		}
		las[x] = i;
	}
	for (auto iter : s) sol[las[iter.second]] = true;
	for (int i = 0; i < v.size(); i++) WriteAdvice(sol[i]);
}
#include <bits/stdc++.h>
#include "assistant.h"
#define X first
#define Y second
 
using namespace std;
const int maxn = 1e5+10;
 
void Assist(unsigned char *A, int N, int K, int R) {
	set< int > active, passive;
	for (int i = 0; i < K; i++) {
		if (A[i] == 1) active.insert(i);
		else passive.insert(i);
	}
	
	//printf("good\n"); fflush(stdout);
	for (int i = 0; i < N; i++) {
		int c = GetRequest();
		//printf("debug: %d\n", c); fflush(stdout);
		//printf("sizes: %d %d\n", active.size(), passive.size()); fflush(stdout);
		if (!active.count(c) && !passive.count(c)) {
			assert(passive.size());
			PutBack(*passive.begin());
			passive.erase(passive.begin());
		}
		active.erase(c);
		passive.erase(c);
		if (A[i + K] == 1) active.insert(c);
		else passive.insert(c);
	}
}

Compilation message

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:19:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for (int i = 0; i < v.size(); i++) {
      |                  ~~^~~~~~~~~~
advisor.cpp:26:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |  for (int i = 0; i < v.size(); i++) sol[i] = false;
      |                  ~~^~~~~~~~~~
advisor.cpp:28:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for (int i = 0; i < v.size(); i++) {
      |                  ~~^~~~~~~~~~
advisor.cpp:31:8: warning: unused variable 'tr' [-Wunused-variable]
   31 |    int tr = s.begin()->second;
      |        ^~
advisor.cpp:45:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for (int i = 0; i < v.size(); i++) WriteAdvice(sol[i]);
      |                  ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 135120 KB Output is correct
2 Correct 73 ms 135356 KB Output is correct
3 Correct 69 ms 135688 KB Output is correct
4 Correct 71 ms 135300 KB Output is correct
5 Correct 77 ms 135260 KB Output is correct
6 Correct 76 ms 135356 KB Output is correct
7 Correct 79 ms 135496 KB Output is correct
8 Correct 78 ms 135396 KB Output is correct
9 Correct 73 ms 135420 KB Output is correct
10 Correct 74 ms 135548 KB Output is correct
11 Correct 74 ms 135852 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 135996 KB Output is correct
2 Correct 119 ms 137964 KB Output is correct
3 Correct 203 ms 143564 KB Output is correct
4 Correct 130 ms 139960 KB Output is correct
5 Correct 143 ms 140040 KB Output is correct
6 Correct 167 ms 140528 KB Output is correct
7 Correct 188 ms 141920 KB Output is correct
8 Correct 165 ms 141672 KB Output is correct
9 Correct 120 ms 140008 KB Output is correct
10 Correct 209 ms 142904 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 169 ms 139908 KB Output is correct
2 Correct 188 ms 142380 KB Output is correct
3 Correct 199 ms 142396 KB Output is correct
4 Correct 217 ms 142484 KB Output is correct
5 Correct 189 ms 141812 KB Output is correct
6 Correct 197 ms 142416 KB Output is correct
7 Correct 222 ms 142424 KB Output is correct
8 Correct 222 ms 142408 KB Output is correct
9 Correct 195 ms 142612 KB Output is correct
10 Correct 211 ms 142712 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 135656 KB Output is correct
2 Correct 80 ms 135844 KB Output is correct
3 Correct 91 ms 135668 KB Output is correct
4 Correct 78 ms 135612 KB Output is correct
5 Correct 75 ms 135368 KB Output is correct
6 Correct 76 ms 135280 KB Output is correct
7 Correct 71 ms 135432 KB Output is correct
8 Correct 83 ms 135960 KB Output is correct
9 Correct 75 ms 135848 KB Output is correct
10 Correct 78 ms 135764 KB Output is correct

Subtask #5
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 234 ms 140804 KB Output is correct - 120000 bits used
2 Correct 213 ms 140996 KB Output is correct - 122000 bits used
3 Correct 206 ms 141296 KB Output is correct - 125000 bits used
4 Correct 195 ms 141304 KB Output is correct - 125000 bits used
5 Correct 229 ms 141260 KB Output is correct - 125000 bits used
6 Correct 208 ms 141328 KB Output is correct - 125000 bits used
7 Correct 221 ms 141272 KB Output is correct - 124828 bits used
8 Correct 225 ms 141224 KB Output is correct - 124910 bits used
9 Correct 199 ms 141256 KB Output is correct - 125000 bits used
10 Correct 195 ms 141260 KB Output is correct - 125000 bits used