oj.uz

답안 #57066

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
57066 2018-07-13T18:15:49 Z kingpig9 최후의 만찬 (IOI12_supper) C++11
34 / 100
 641 ms 47864 KB 
#include <bits/stdc++.h>
#include "advisor.h"

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
static const int MAXN = 1e5 + 10;

//#define debug(...) fprintf(stderr, __VA_ARGS__)
#define debug(...)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define fillchar(a, s) memset((a), (s), sizeof(a))

#warning static (advisor)

static int subtask;
static int *C, N, K, M;
static int logn, logk;
static set<pii> st;	//pii(when we neet i, i) -- you remove GREATEST of them.
static bool has[MAXN];
static vector<int> inds[MAXN];

static vector<int> getans() {
	//let's just implement -- get the bits
	//+ 10 just for the adjustment. Makes no difference for max values of N, K.

	for (int i = 0; i < N; i++) {
		inds[i].push_back(N);
	}
	for (int i = N - 1; i >= 0; i--) {
		inds[C[i]].push_back(i);
	}

	for (int i = 0; i < K; i++) {
		has[i] = true;
		st.emplace(inds[i].back(), i);
	}

	vector<int> ans;
	for (int i = 0; i < N; i++) {
		if (has[C[i]]) {
			st.erase(pii(inds[C[i]].back(), C[i]));
			inds[C[i]].pop_back();
			st.insert(pii(inds[C[i]].back(), C[i]));
			ans.push_back(N);	//this is bad
			debug("Bad\n");
			continue;
		}

		//remove one
		inds[C[i]].pop_back();
		auto it = --st.end();
		pii tp = *it;
		st.erase(it);
		has[tp.se] = false;
		debug("tp.se = %d\n", tp.se);
		ans.push_back(tp.se);
		st.insert(pii(inds[C[i]].back(), C[i]));

		//add C[i]
		has[C[i]] = true;
	}
	return ans;
}

static void send (int x, int largestbit) {
	debug("x = %d. ADVICE: ", x);
	for (int i = largestbit; i >= 0; i--) {
		WriteAdvice((x >> i) & 1);
		debug("%d", (x >> i) & 1);
	}
	debug("\n");
}

namespace advisor_subtask3 {
	int where[MAXN];
	int cur[MAXN];

	void go() {
		//if < 25000
		vector<int> ans = getans();

		for (int i = 0; i < K; i++) {
			where[i] = i;
			cur[i] = i;
		}

		for (int i = 0; i < N; i++) {
			int x = ans[i];
			if (x == N) {
				//nothing changes.
				send(K, logk);
				continue;
			}
			//want to remove x
			int w = where[x];
			assert(w < K);
			where[C[i]] = w;
			cur[w] = C[i];
			send(w, logk);
		}
	}
}

void ComputeAdvice (int *ccc, int nnn, int kkk, int mmm) {
	C = ccc;
	N = nnn;
	K = kkk;
	M = mmm;
	logn = 31 - __builtin_clz(N + 10);
	logk = 31 - __builtin_clz(K + 10);
	advisor_subtask3::go();
}

#include <bits/stdc++.h>
#include "assistant.h"

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
static const int MAXN = 1e5 + 10;

//#define debug(...) fprintf(stderr, __VA_ARGS__)
#define debug(...)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define fillchar(a, s) memset((a), (s), sizeof(a))

#warning static (assistant)

static int subtask;
static unsigned char *A;
static int N, K, R;
static int logn, logk;

namespace assistant_subtask3 {
	int where[MAXN];
	int cur[MAXN];

	void go() {
		for (int i = 0; i < K; i++) {
			where[i] = i;
			cur[i] = i;
		}

		for (int i = 0; i < N; i++) {
			//replace it with this
			int req = GetRequest();
			//you replace whatever is here.
			int x = 0;
			for (int j = 0; j <= logk; j++) {
				int pos = (logk + 1) * i + j;
				x = 2 * x + A[pos];
			}
			debug("x = %d\n", x);

			if (x != K) {
				assert(x < K);
				//then check what is here!
				//delete what is at position x, put it at
				debug("PutBack(%d)\n", cur[x]);
				PutBack(cur[x]);
				cur[x] = req;
				where[req] = x;
			}
		}
	}
}

void Assist (unsigned char *aaa, int nnn, int kkk, int rrr) {
	A = aaa;
	N = nnn;
	K = kkk;
	R = rrr;
	logn = 31 - __builtin_clz(N + 10);
	logk = 31 - __builtin_clz(K + 10);
	assistant_subtask3::go();
}

Compilation message

advisor.cpp:17:2: warning: #warning static (advisor) [-Wcpp]
 #warning static (advisor)
  ^~~~~~~
advisor.cpp:19:12: warning: 'subtask' defined but not used [-Wunused-variable]
 static int subtask;
            ^~~~~~~

assistant.cpp:17:2: warning: #warning static (assistant) [-Wcpp]
 #warning static (assistant)
  ^~~~~~~
assistant.cpp:19:12: warning: 'subtask' defined but not used [-Wunused-variable]
 static int subtask;
            ^~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5360 KB Output is correct
2 Correct 8 ms 5728 KB Output is correct
3 Correct 13 ms 5856 KB Output is correct
4 Correct 15 ms 6152 KB Output is correct
5 Correct 19 ms 6560 KB Output is correct
6 Correct 24 ms 6760 KB Output is correct
7 Correct 20 ms 7064 KB Output is correct
8 Correct 20 ms 7064 KB Output is correct
9 Correct 28 ms 7160 KB Output is correct
10 Correct 25 ms 7208 KB Output is correct
11 Correct 27 ms 7512 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 8328 KB Output is correct
2 Correct 209 ms 16416 KB Output is correct
3 Correct 472 ms 30432 KB Output is correct
4 Correct 227 ms 30432 KB Output is correct
5 Correct 405 ms 30432 KB Output is correct
6 Correct 456 ms 30432 KB Output is correct
7 Correct 593 ms 33056 KB Output is correct
8 Correct 375 ms 33056 KB Output is correct
9 Correct 165 ms 33056 KB Output is correct
10 Correct 500 ms 37552 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 432 ms 37552 KB Output is correct
2 Correct 577 ms 38096 KB Output is correct
3 Correct 524 ms 39448 KB Output is correct
4 Correct 437 ms 40600 KB Output is correct
5 Correct 429 ms 41496 KB Output is correct
6 Correct 548 ms 43008 KB Output is correct
7 Correct 448 ms 44008 KB Output is correct
8 Correct 510 ms 44960 KB Output is correct
9 Correct 538 ms 47696 KB Output is correct
10 Correct 582 ms 47696 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
8.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 479 ms 47696 KB Output is partially correct - 1500000 bits used
2 Partially correct 516 ms 47696 KB Output is partially correct - 1500000 bits used
3 Partially correct 444 ms 47696 KB Output is partially correct - 1500000 bits used
4 Partially correct 498 ms 47752 KB Output is partially correct - 1500000 bits used
5 Partially correct 555 ms 47752 KB Output is partially correct - 1500000 bits used
6 Partially correct 437 ms 47752 KB Output is partially correct - 1500000 bits used
7 Partially correct 443 ms 47864 KB Output is partially correct - 1497585 bits used
8 Partially correct 502 ms 47864 KB Output is partially correct - 1500000 bits used
9 Partially correct 641 ms 47864 KB Output is partially correct - 1500000 bits used
10 Partially correct 443 ms 47864 KB Output is partially correct - 1500000 bits used