제출 #522846

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
522846		OJtester	The Collection Game (BOI21_swaps)	C++17	50 / 100	59 ms	536 KiB

swaps

//Forwarded from QOJ19590
#include "swaps.h"
#include <bits/stdc++.h>
#define pi pair<int,int>
#define mk make_pair
#define rep(i,  a) for(register int i=1,i##end=a;i<=i##end;i++)
using namespace std;
void solve(int n, int D) {
	vector<int>ans;ans.resize(n);
	rep(i,n)ans[i-1]=i;
	for (int i=0;i<500;i++) {
		vector<pi>A;
		for(int j=i%2;j+1<ans.size();j+=2) {
			schedule(ans[j],ans[j+1]);
			A.push_back(mk(j,j+1));
		}
		if(!A.empty()){
			auto res=visit();
			for(int j=0;j<A.size();j++)
				if(!res[j])swap(ans[A[j].first],ans[A[j].second]);
		}
	}
	answer(ans);return;
}

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

swaps.cpp: In function 'void solve(int, int)':
swaps.cpp:10:6: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   10 |  rep(i,n)ans[i-1]=i;
      |      ^
swaps.cpp:6:37: note: in definition of macro 'rep'
    6 | #define rep(i,  a) for(register int i=1,i##end=a;i<=i##end;i++)
      |                                     ^
swaps.cpp:10:6: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   10 |  rep(i,n)ans[i-1]=i;
      |      ^
swaps.cpp:6:41: note: in definition of macro 'rep'
    6 | #define rep(i,  a) for(register int i=1,i##end=a;i<=i##end;i++)
      |                                         ^
swaps.cpp:13:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |   for(int j=i%2;j+1<ans.size();j+=2) {
      |                 ~~~^~~~~~~~~~~
swaps.cpp:19:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |    for(int j=0;j<A.size();j++)
      |                ~^~~~~~~~~

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