oj.uz

Submission #698497

# Submission time Handle Problem Language Result Execution time Memory
698497 2023-02-13T15:48:50 Z arneves Last supper (IOI12_supper) C++17
0 / 100
 2500 ms 70028 KB 
/*
	  ______  _____  _______ _     _ _______ __   _  _____  _  _  _
	 |_____/ |     | |       |____/  |______ | \  | |     | |  |  |
	 |    \_ |_____| |_____  |    \_ ______| |  \_| |_____| |__|__|
	
	
	       .      .           .      .           .      .    	
	       _\/  \/_           _\/  \/_           _\/  \/_    	
	        _\/\/_             _\/\/_             _\/\/_     	
	    _\_\_\/\/_/_/_     _\_\_\/\/_/_/_     _\_\_\/\/_/_/_ 	
	     / /_/\/\_\ \       / /_/\/\_\ \       / /_/\/\_\ \  	
	        _/\/\_             _/\/\_             _/\/\_     	
	        /\  /\             /\  /\             /\  /\     	
	       '      '           '      '           '      '    	
	
*/
 
#pragma GCC optimize ("O3")
#pragma GCC target ("avx2")
 
 
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cstdint>
#include <cmath>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <vector>

using namespace std;

#include "advisor.h"

void ComputeAdvice(int *C, int N, int K, int M) {
	
	vector<deque<int> > times(N, deque<int>());
	
	for(int i=0; i<N; i++){
		times[C[i]].push_back(i);
	}
	
	for(int i=0; i<N; i++){
		times[i].push_back(1e6);
	}
	
	priority_queue<pair<int,int> > q;
	set<int> d;
	
	for(int i=0; i<K; i++){
		d.insert(i);
		q.push({times[i].front(),i});
	}
	
	for(int i=0; i<N; i++){
		times[C[i]].pop_front();
		if(d.find(C[i])==d.end()){
			d.insert(C[i]);
			
			int y=q.top().second; q.pop();
			while(d.find(y)==d.end()) y=q.top().second; q.pop();
			d.erase(y);
			
			for(int bit=0; bit<17; bit++){
				if((1<<bit)&y) WriteAdvice(1);
				else WriteAdvice(0);
			}
		}
		d.insert(C[i]);
		q.push({times[i].front(),i});
	}
}

/*
	  ______  _____  _______ _     _ _______ __   _  _____  _  _  _
	 |_____/ |     | |       |____/  |______ | \  | |     | |  |  |
	 |    \_ |_____| |_____  |    \_ ______| |  \_| |_____| |__|__|
	
	
	       .      .           .      .           .      .    	
	       _\/  \/_           _\/  \/_           _\/  \/_    	
	        _\/\/_             _\/\/_             _\/\/_     	
	    _\_\_\/\/_/_/_     _\_\_\/\/_/_/_     _\_\_\/\/_/_/_ 	
	     / /_/\/\_\ \       / /_/\/\_\ \       / /_/\/\_\ \  	
	        _/\/\_             _/\/\_             _/\/\_     	
	        /\  /\             /\  /\             /\  /\     	
	       '      '           '      '           '      '    	
	
*/
 
#pragma GCC optimize ("O3")
#pragma GCC target ("avx2")
 
 
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cstdint>
#include <cmath>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <vector>

using namespace std;

#include "assistant.h"

void Assist(unsigned char *A, int N, int K, int R) {
	
	set<int> s;
	for(int i=0; i<K; i++){
		s.insert(i);
	}
	
	int c=0;
	
	for (int i = 0; i < N; i++) {
		int req = GetRequest();
		
		if(s.find(req)==s.end()){
			int y=0;
			
			for(int bit=0; bit<17; bit++){
				if(A[bit+c]) y|=(1<<bit);
			}
			c+=17;
			PutBack(y);
			s.erase(y);
		}
		s.insert(req);
	}
}

Compilation message

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:80:4: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   80 |    while(d.find(y)==d.end()) y=q.top().second; q.pop();
      |    ^~~~~
advisor.cpp:80:48: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   80 |    while(d.find(y)==d.end()) y=q.top().second; q.pop();
      |                                                ^

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2589 ms 7124 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2566 ms 56260 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2569 ms 3028 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2581 ms 69700 KB Time limit exceeded
2 Execution timed out 2590 ms 69804 KB Time limit exceeded
3 Execution timed out 2580 ms 69960 KB Time limit exceeded
4 Execution timed out 2598 ms 69936 KB Time limit exceeded
5 Execution timed out 2583 ms 69972 KB Time limit exceeded
6 Execution timed out 2574 ms 69968 KB Time limit exceeded
7 Execution timed out 2578 ms 70028 KB Time limit exceeded
8 Execution timed out 2571 ms 69996 KB Time limit exceeded
9 Execution timed out 2584 ms 70000 KB Time limit exceeded
10 Execution timed out 2592 ms 69936 KB Time limit exceeded