oj.uz

Submission #104843

# Submission time Handle Problem Language Result Execution time Memory
104843 2019-04-09T11:03:03 Z figter001 Last supper (IOI12_supper) C++17
0 / 100
 82 ms 15096 KB 
#include "advisor.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int nax = 1e5 + 50;
const int oo = 1e9;

vector<int> lst[nax];
set<pair<int,int>> st;
bool in[nax],rem[nax];

void ComputeAdvice(int *C, int n, int k, int M) {
	for(int i=0;i<n;i++)
		lst[i].push_back(oo);
	for(int i=n-1;i>=0;i--)
		lst[C[i]].push_back(i);
	for(int i=0;i<k;i++){
		st.insert({-lst[i].back(),i});
		lst[i].pop_back();
		in[i] = 1;
	}
	vector<pair<int,int>> w;

	for(int i=0;i<n;i++){
		if(in[C[i]] == 1){
			w.push_back({1,-1});
			st.erase(st.end());
			int id = C[i];
			st.insert({-lst[id].back(),id});
			lst[id].pop_back();
		}else{
			w.push_back({0,C[i]});
			int id = st.begin()->second;
			in[id] = 0;
			in[C[i]] = 1;
			if(id <= k)
				rem[id] = 1;
			st.erase(st.begin());
			st.insert({-lst[id].back(),id});
			lst[id].pop_back();
		}
	}
	for(int i=n-1;i>=0;i--){
		if(w[i].first == 0){
			w[i].second = in[C[i]];
			in[C[i]] = 0;
		}
	}
	for(int i=0;i<k;i++)
		WriteAdvice(rem[i]);

	for(int i=0;i<n;i++){
		if(w[i].first == 1){
			WriteAdvice(1);
		}else{
			WriteAdvice(0);
			WriteAdvice(w[i].second);
		}
	}
}

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

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int nax = 1e5 + 50;
const int oo = 1e9;

void Assist(unsigned char *A, int n, int k, int R) {
	int at = 0;
	vector<int> r;
	for(int i=0;i<k;i++){
		if(A[at] == '1')
			r.push_back(i);
		at++;
	}
	for(int i=0;i<n;i++){
    	int req = GetRequest();
    	if(A[at] == '0'){
    		at++;
    		PutBack(r.back());
    		r.pop_back();
    		if(A[at] == '0')
    			r.push_back(req);
    	}
      	at++;
  	}

}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 11 ms 5248 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 20 ms 6272 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 44 ms 13060 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 5760 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

# Verdict Execution time Memory Grader output
1 Runtime error 70 ms 14584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Runtime error 82 ms 14860 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 54 ms 14968 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 79 ms 14968 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 78 ms 15000 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 76 ms 15028 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 56 ms 14968 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 77 ms 15096 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 68 ms 14968 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 75 ms 14824 KB Execution killed with signal 11 (could be triggered by violating memory limits)