oj.uz

답안 #257736

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
257736 2020-08-04T16:39:40 Z Noam13 최후의 만찬 (IOI12_supper) C++14
0 / 100
 168 ms 11504 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;
			in[a[i]] = i;
			q.erase({a[i],i});
			q.insert({a[i], next[i]});
		}
		else{ //out
			ii cur = *q.begin(); q.erase(q.begin());
			bits[cur.y] = 0;
			in.erase(cur.x);
			q.insert({next[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);
	}
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 780 KB Output is correct
2 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 4 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 37 ms 7288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 40 ms 8164 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Runtime error 45 ms 8568 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 47 ms 9208 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 46 ms 9336 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 44 ms 9208 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 44 ms 9208 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 48 ms 9208 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 48 ms 9336 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 45 ms 9208 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Incorrect 168 ms 11504 KB Output isn't correct - not an optimal way