제출 #315063

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
315063		Kevin_Zhang_TW	Mouse (info1cup19_mouse)	C++17	34 / 100	366 ms	632 KiB

mouse

#include<bits/stdc++.h>
#define pb emplace_back
#define AI(i) begin(i), end(i)
using namespace std;
using ll = long long;
const int MAX_N = 300;
int n;
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void debug(auto L, auto R) { while (L < R) cerr << *L << " \n"[L+1==R], ++L; }
void kout(){ cerr << endl; }
template<class T1, class ...T2> void kout(T1 a, T2 ...e) { cerr << a << ' ', kout(e...); }
vector<int> p{1,2,3,4,5,6,7,8,9,10,11,12,13};
int qcnt;
int query(vector<int> q) { 
	++qcnt;
	int res = 0;
	for (int i = 0;i < n;++i) 
		res += p[i] == q[i];
	if (res == n)
		DE(n, qcnt);
	return res;
}
#else
#define DE(...) 0
void debug(...) {}
#include "grader.h"
#endif
random_device rd;
mt19937 gen(rd());
void solve(int N) {
	n = N;
	vector<int> q(n);
	iota(AI(q), 1);
	shuffle(AI(q), gen);
	int cur_same = query(q);
	for (int i = 0;i < n && cur_same < n;++i) {
		for (int j = i+1;j < n && cur_same < n;++j) {
			swap(q[i], q[j]);
			int v = query(q);
			if (v <= cur_same)
				swap(q[i], q[j]);
			else {
				cur_same = v;
			}
		}
	}
	DE(cur_same);
	assert(cur_same == n);
}
#ifdef KEV
int main() {
	solve(p.size());
}
#endif

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

mouse.cpp: In function 'void solve(int)':
mouse.cpp:25:17: warning: statement has no effect [-Wunused-value]
   25 | #define DE(...) 0
      |                 ^
mouse.cpp:48:2: note: in expansion of macro 'DE'
   48 |  DE(cur_same);
      |  ^~

• Subtask 1: 13 / 13
• Subtask 2: 21.000016000000002 / 38
• Subtask 3: 0 / 49