oj.uz

답안 #257737

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
257737 2020-08-04T16:46:50 Z Noam13 최후의 만찬 (IOI12_supper) C++14
0 / 100
 250 ms 10224 KB 
#include "advisor.h"
#include <bits/stdc++.h>
#define vi vector<int>
#define vb vector<bool>
#define ii pair<int,int>
#define vvi vector<vi>
#define vvb vector<vb>
#define vii vector<ii>
#define vvii vector<vii>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define loop(i,s,e) for(int i=s;i<e;i++)
#define loopr(i,s,e) for(int i=e-1;i>=s;i--)
#define chkmax(a,b) a=max(a,b)
#define chkmin(a,b) a=min(a,b)
#define all(x) x.begin(),x.end()
using namespace std;
const int INF = 1e9, MOD=1e9+7;

void ComputeAdvice(int *C, int n, int k, int M) {
	vi a(n+k);
	loop(i,0,k) a[i]=i;
	loop(i,0,n) a[i+k]=C[i];
    vi next(n+k);
	vi last(n, -1);
	loopr(i,0,n+k) {
		next[i] = last[a[i]];
		last[a[i]] = i;
	}
	set<ii> q;
	map<int, int> in;
	loop(i,0,k) {
		q.insert({next[i],i});
		in[i] = i;
	}
	vb bits(n+k);
	loop(i,k,n+k){
		if (in.find(a[i])!=in.end()){ //already in
			bits[in[a[i]]] = 1;
			q.erase(q.lower_bound({i, -INF}));
		}
		else{ //out
			ii cur = *q.begin(); q.erase(q.begin());
			bits[cur.y] = 0;
			in.erase(a[cur.y]);
		}
		q.insert({next[i], i});
		in[a[i]] = i;
	}
	loop(i,0,n+k) WriteAdvice(bits[i]);
}
/*
color a
cls
g++ advisor.cpp -o a & a

*/

#include "assistant.h"
#include <bits/stdc++.h>
#define vi vector<int>
#define vb vector<bool>
#define ii pair<int,int>
#define vvi vector<vi>
#define vvb vector<vb>
#define vii vector<ii>
#define vvii vector<vii>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define loop(i,s,e) for(int i=s;i<e;i++)
#define loopr(i,s,e) for(int i=e-1;i>=s;i--)
#define chkmax(a,b) a=max(a,b)
#define chkmin(a,b) a=min(a,b)
#define all(x) x.begin(),x.end()
using namespace std;
const int INF = 1e9, MOD=1e9+7;

void Assist(unsigned char *A, int n, int k, int R) {
	map<int, int> s; 
	set<int> fre;
	loop(i,0,k) {
		s[i] = i;
		if (!A[i]) fre.insert(i);
	}
	//cout<<"HI"<<endl;
	loop(i,k,n+k){
		int v = GetRequest();
		if (s.find(v)!=s.end()){
			if (fre.find(v)!=fre.end()) fre.erase(v);
		}
		else{
			int back = *fre.begin();
			PutBack(back);
			s.erase(back);
			fre.erase(fre.begin());
		}
		s[v] = i;
		if (!A[i]) fre.insert(v);
	}
}
/*
color a
cls
g++ assistant.cpp -o a & a

*/

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 780 KB Output is correct
2 Correct 1 ms 772 KB Output is correct
3 Correct 3 ms 912 KB Output is correct
4 Incorrect 3 ms 992 KB Output isn't correct - not an optimal way
5 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 1356 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 185 ms 7168 KB Output is correct
2 Correct 236 ms 10224 KB Output is correct
3 Correct 250 ms 10224 KB Output is correct
4 Correct 236 ms 10224 KB Output is correct
5 Incorrect 236 ms 9200 KB Output isn't correct - not an optimal way
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1228 KB Output is correct
2 Correct 9 ms 1176 KB Output is correct
3 Incorrect 6 ms 1216 KB Output isn't correct - not an optimal way
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 223 ms 8008 KB Output isn't correct - not an optimal way
2 Correct 225 ms 8408 KB Output is correct - 122000 bits used
3 Correct 233 ms 9208 KB Output is correct - 125000 bits used
4 Correct 237 ms 9208 KB Output is correct - 125000 bits used
5 Correct 241 ms 9200 KB Output is correct - 125000 bits used
6 Correct 232 ms 9200 KB Output is correct - 125000 bits used
7 Correct 250 ms 9200 KB Output is correct - 124828 bits used
8 Correct 241 ms 9000 KB Output is correct - 124910 bits used
9 Correct 233 ms 9200 KB Output is correct - 125000 bits used
10 Incorrect 227 ms 9200 KB Output isn't correct - not an optimal way