oj.uz

Submission #361574

# Submission time Handle Problem Language Result Execution time Memory
361574 2021-01-30T15:33:30 Z MetB Last supper (IOI12_supper) C++14
0 / 100
 187 ms 12764 KB 
#include <iostream>
#include <vector>
#include <set>
#include "advisor.h"

using namespace std;

void ComputeAdvice(int *C, int N, int K, int M) {
	vector<vector<int>> last(N);
	vector<int> ans(N), ans_k(K);
	vector<int> request(N, -1);
	vector<int> ptr(N, 0), st(N);
	set<pair<int, int>> s;

	for (int i = 0; i < N; i++) {
		last[C[i]].push_back(i);
	}

	for (int i = 0; i < N; i++) {
		last[i].push_back(N);
	}

	for (int i = 0; i < K; i++) {
		ptr[i]++;
		s.insert({last[i][0], i});
		st[i] = 1;
	}

	for (int i = 0; i < N; i++) {
		/*for (auto a : s) {
			cout << a.first << ' ' << a.second << endl;
		}
		cout << "----\n";*/

		request[C[i]] = i;
		if (!st[C[i]]) {
			int x = s.rbegin()->second;
			s.erase(s.find(*s.rbegin()));
			st[x] = 0;
			if (request[x] != -1) ans[request[x]] = 1;
			else ans_k[x] = 1;
			while(last[C[i]][ptr[C[i]]] <= i) ptr[C[i]]++;
			s.insert({last[C[i]][ptr[C[i]]], C[i]});
		} else {
			s.erase({last[C[i]][ptr[C[i]]], C[i]});
			while(last[C[i]][ptr[C[i]]] <= i) ptr[C[i]]++;
			s.insert({last[C[i]][ptr[C[i]]], C[i]});

		}
		st[C[i]] = 1;
	}

	for (int i = 0; i < K; i++) {
		WriteAdvice(ans_k[i]);
	}

	for (int i = 0; i < N; i++) {
		WriteAdvice(ans[i]);
	}
}

#include <iostream>
#include <vector>
#include "assistant.h"

using namespace std;

void Assist(unsigned char *A, int N, int K, int R) {
	vector<int> st(N);
	vector<int> bottom_shelf;
	for (int i = 0; i < K; i++) {
		if (A[i]) bottom_shelf.push_back(i);
		st[i] = 1;
	}

	A += K;

	for (int i = 0; i < N; i++) {
		int x = GetRequest();
		if (!st[x]) {
			PutBack(bottom_shelf.back());
			bottom_shelf.pop_back();
		}
		st[x] = 1;
		if (A[i]) bottom_shelf.push_back(x);
	}

}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1020 KB Output is correct
2 Correct 1 ms 780 KB Output is correct
3 Correct 3 ms 1028 KB Output is correct
4 Incorrect 3 ms 1244 KB Error - Not putting back color when it is not on the scaffold
5 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 1964 KB Error - Not putting back color when it is not on the scaffold
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 9976 KB Output is correct
2 Correct 153 ms 12288 KB Output is correct
3 Correct 156 ms 12228 KB Output is correct
4 Correct 161 ms 12376 KB Output is correct
5 Incorrect 158 ms 11832 KB Error - Not putting back color when it is not on the scaffold
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1352 KB Output is correct
2 Incorrect 6 ms 1288 KB Output isn't correct - not an optimal way
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 150 ms 11828 KB Error - Not putting back color when it is not on the scaffold
2 Correct 187 ms 12196 KB Output is correct - 122000 bits used
3 Correct 166 ms 12280 KB Output is correct - 125000 bits used
4 Correct 173 ms 12348 KB Output is correct - 125000 bits used
5 Correct 154 ms 12220 KB Output is correct - 125000 bits used
6 Correct 154 ms 12364 KB Output is correct - 125000 bits used
7 Correct 176 ms 12476 KB Output is correct - 124828 bits used
8 Correct 169 ms 12184 KB Output is correct - 124910 bits used
9 Correct 151 ms 12348 KB Output is correct - 125000 bits used
10 Incorrect 142 ms 12764 KB Error - Not putting back color when it is not on the scaffold