oj.uz

답안 #640051

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
640051 2022-09-13T11:57:37 Z jasmin The Collection Game (BOI21_swaps) C++14
35 / 100
 87 ms 588 KB 
#include <swaps.h>
#include<cassert>
#include <algorithm>
#include <functional>
#include <vector>
#include <iostream>
using namespace std;
 
/*void schedule(int i, int j){
    cout << "schedule " << i << " " << j << "\n" << flush;
}
 
vector<int> visit(){
    cout << "visit\n" << flush;
    int n;
    cin >> n;
    vector<int> ans(n);
    for(int i=0; i<n; i++){
        cin >> ans[i];
    }
    cout << "Yes: " << n << "\n";
    return ans;
}
 
void answer(vector<int>& ans){
    cout << "answer: \n";
    for(auto e: ans){
        cout << e << " ";
    }
    cout << "\n" << flush;
}*/
 
void solve(int n, int v){
	vector<vector<int> > op(n);
	for(int i=0; i<n; i++){
		op[0].push_back(i+1);
	}
 
	int q=0;
	while(true){
 
		int cnt=0;
		for(int j=0; j<n; j++){
			for(int k=0; k+1<(int)op[j].size(); k+=2){
				schedule(op[j][k], op[j][k+1]);
				cnt++;
			}
		}
		
		if(cnt==0) break;
		
		if(q==v) cout << "meep\n";
 
		vector<int> resp=visit();
		q++;
		int ind=0;
		vector<vector<int> > op2(n);
		for(int j=0; j<n; j++){
			for(int k=0; k+1<(int)op[j].size(); k+=2){
				if(resp[ind]){
					op2[j].push_back(op[j][k]);
					op2[j+1].push_back(op[j][k+1]);
				}
				else{
					op2[j+1].push_back(op[j][k]);
					op2[j].push_back(op[j][k+1]);
				}
				ind++;
			}
			if(op[j].size()%2==1){
				op2[j].push_back(op[j][op[j].size()-1]);
			}
		}
		op=op2;
	}
  	
  	vector<int> ans(n);
  	for(int i=0; i<n; i++){
  		assert(op[i].size()==1);
    	ans[i]=op[i][0];
    }
  	answer(ans);
}
 
/*signed main(){
	int n, v;
	cin >> n >> v;
	solve(n, v);
}*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 6 ms 316 KB Correct
3 Correct 26 ms 320 KB Correct
4 Correct 68 ms 356 KB Correct
5 Correct 69 ms 392 KB Correct
6 Correct 66 ms 396 KB Correct
7 Correct 84 ms 400 KB Correct
8 Correct 87 ms 364 KB Correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 5 ms 208 KB Correct
3 Correct 19 ms 328 KB Correct
4 Correct 74 ms 396 KB Correct
5 Correct 84 ms 420 KB Correct
6 Correct 69 ms 460 KB Correct
7 Correct 63 ms 384 KB Correct
8 Correct 74 ms 436 KB Correct
9 Correct 68 ms 400 KB Correct
10 Correct 68 ms 388 KB Correct
11 Correct 84 ms 356 KB Correct
12 Correct 83 ms 404 KB Correct
13 Correct 73 ms 448 KB Correct

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 5 ms 208 KB Correct

Subtask #4
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 5 ms 208 KB Correct
3 Correct 1 ms 208 KB Correct
4 Correct 5 ms 208 KB Correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 5 ms 208 KB Correct
3 Correct 25 ms 444 KB Correct
4 Correct 72 ms 388 KB Correct

Subtask #6
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 5 ms 208 KB Correct
3 Correct 25 ms 444 KB Correct
4 Correct 72 ms 388 KB Correct
5 Correct 1 ms 208 KB Correct
6 Correct 4 ms 208 KB Correct
7 Correct 19 ms 328 KB Correct
8 Correct 72 ms 356 KB Correct
9 Correct 79 ms 408 KB Correct
10 Correct 74 ms 356 KB Correct
11 Correct 73 ms 372 KB Correct
12 Correct 67 ms 356 KB Correct
13 Correct 1 ms 208 KB Correct
14 Correct 5 ms 312 KB Correct
15 Correct 26 ms 320 KB Correct
16 Correct 76 ms 488 KB Correct

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Correct
2 Correct 5 ms 208 KB Correct
3 Correct 21 ms 308 KB Correct
4 Correct 69 ms 368 KB Correct
5 Runtime error 42 ms 500 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Correct
2 Correct 5 ms 208 KB Correct
3 Correct 21 ms 308 KB Correct
4 Correct 69 ms 368 KB Correct
5 Runtime error 42 ms 500 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #9
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Correct
2 Correct 5 ms 208 KB Correct
3 Correct 20 ms 332 KB Correct
4 Correct 73 ms 504 KB Correct
5 Runtime error 57 ms 512 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Correct
2 Correct 5 ms 208 KB Correct
3 Correct 20 ms 332 KB Correct
4 Correct 73 ms 504 KB Correct
5 Runtime error 57 ms 512 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #11
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 5 ms 208 KB Correct
3 Correct 24 ms 336 KB Correct
4 Correct 75 ms 420 KB Correct
5 Runtime error 44 ms 588 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #12
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 5 ms 208 KB Correct
3 Correct 24 ms 336 KB Correct
4 Correct 75 ms 420 KB Correct
5 Runtime error 44 ms 588 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -