제출 #583330

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
583330		WongChun1234	The Collection Game (BOI21_swaps)	C++14	12 / 100	50 ms	352 KiB

swaps

//
// --- Sample implementation for the task swaps ---
//
// To compile this program with the sample grader, place:
//     swaps.h swaps_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ swaps_sample.cpp sample_grader.cpp
// in this folder.
//
#include "swaps.h"
#include<bits/stdc++.h>
using namespace std;
const int N=550;
int rrl[N];
vector<pair<int,int>> sch;

void solve(int n, int v) {
    // TODO implement this function
    for (int i=1;i<=n;i++) rrl[i]=i;
    for (int i=2;i<=n;i++){
    	for (int j=(i%2)+1;j<i;j+=2){
    		schedule(rrl[j],rrl[j+1]);
    		sch.push_back({rrl[j],rrl[j+1]});
		}
		vector<int> res=visit();
		for (int j=0,pos=(i%2)+1;j<res.size();j++,pos+=2){
			if (res[j]){
				//frnt < back, 60% must
				//rrl[j] now has smaller one
			}else{
				//rrl[j] has bigger one
				swap(rrl[pos],rrl[pos+1]);
			}
		}
		sch.clear();
	}
    for (int i=n-1;i>=2;i--){
    	for (int j=(i%2)+1;j<i;j+=2){
    		schedule(rrl[j],rrl[j+1]);
    		sch.push_back({rrl[j],rrl[j+1]});
		}
		vector<int> res=visit();
		for (int j=0,pos=(i%2)+1;j<res.size();j++,pos+=2){
			if (res[j]){
				//frnt < back, 60% must
				//rrl[j] now has smaller one
			}else{
				//rrl[j] has bigger one
				swap(rrl[pos],rrl[pos+1]);
			}
		}
		sch.clear();
	}
	vector<int> ans(n);
	for (int i=1;i<=n;i++) ans[rrl[i]-1]=i;
	answer(ans);
}

컴파일 시 표준 에러 (stderr) 메시지

swaps.cpp: In function 'void solve(int, int)':
swaps.cpp:26:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |   for (int j=0,pos=(i%2)+1;j<res.size();j++,pos+=2){
      |                            ~^~~~~~~~~~~
swaps.cpp:43:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |   for (int j=0,pos=(i%2)+1;j<res.size();j++,pos+=2){
      |                            ~^~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 3 / 3
• Subtask 4: 0 / 2
• Subtask 5: 9 / 9
• Subtask 6: 0 / 6
• Subtask 7: 0 / 9
• Subtask 8: 0 / 6
• Subtask 9: 0 / 21
• Subtask 10: 0 / 14
• Subtask 11: 0 / 9
• Subtask 12: 0 / 6