oj.uz

Submission #954326

# Submission time Handle Problem Language Result Execution time Memory
954326 2024-03-27T15:45:59 Z LCJLY Super Dango Maker (JOI22_dango3) C++17
22 / 100
 10000 ms 1036 KB 
#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;

//code
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef pair<pii,pii>pi2;

//Query()  Answer()

void Solve(int n, int m) {
	vector<int>arr[m];
	arr[0].push_back(1);
	
	vector<int>v;
	for(int x=n*m;x>=2;x--){
		v.push_back(x);
	}
	
	int ptr=1;
	for(int x=2;x<=n*m;x++){
		unordered_set<int>se;
		
		int l=0;
		int r=ptr;
		int mid;
		int best=r;
		
		while(l<=r){
			mid=(l+r)/2;
			unordered_set<int>se;
			for(int y=0;y<=mid;y++){
				for(auto it:arr[y]) se.insert(it);
			}
			vector<int>que;
			for(int i=1;i<=n*m;i++){
				if(i==x) continue;
				if(se.find(i)!=se.end()) continue;
				que.push_back(i);
			}
			int hold=Query(que);
			
			if(hold==m-mid-1){
				best=mid;
				r=mid-1;
			}
			else l=mid+1;
		}
		
		ptr=max(ptr,best+1);
		arr[best].push_back(x);
		
		//for(int y=0;y<m;y++){
			//for(auto it:arr[y]) se.insert(it);
			//vector<int>que;
			//for(int i=1;i<=n*m;i++){
				//if(i==x) continue;
				//if(se.find(i)!=se.end()) continue;
				//que.push_back(i);
			//}
			
			//int hold=Query(que);
			//if(hold==m-y-1){
				//arr[y].push_back(x);
				//break;
			//}
		//}
	}
	
	for(int x=0;x<m;x++){
		Answer(arr[x]);
	}
}
//code

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 520 KB Output is correct
2 Correct 93 ms 520 KB Output is correct
3 Correct 77 ms 536 KB Output is correct
4 Correct 75 ms 344 KB Output is correct
5 Correct 77 ms 348 KB Output is correct
6 Correct 73 ms 344 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3015 ms 964 KB Output is correct
2 Correct 3070 ms 992 KB Output is correct
3 Correct 2450 ms 760 KB Output is correct
4 Correct 2450 ms 760 KB Output is correct
5 Correct 2766 ms 988 KB Output is correct
6 Correct 2695 ms 744 KB Output is correct

Subtask #4
0 / 78.0

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