제출 #1010815

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1010815		vjudge1	Queue (CEOI06_queue)	C++17	4 / 100	199 ms	19024 KiB

queue

#include<bits/stdc++.h>
using namespace std;
#ifdef ONPC
#include"debug.h"
#else
#define debug(...) 42
#endif
#define endl '\n'
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
//#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
const int mod = 1e9 + 7;
const int MAXN = 1e6 + 15;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
map<int, int> prv, nxt;

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	for (int i = 0; i < n; i++){
		int a, b;
		cin >> a >> b;
		int pa = (prv.count(a) ? prv[a] : a - 1);
		int na = (nxt.count(a) ? nxt[a] : a + 1);
		nxt[pa] = na;
		prv[na] = pa;

		int pb = (prv.count(b) ? prv[b] : b - 1);
		nxt[pb] = a;
		prv[a] = pb;
		nxt[a] = b;
		prv[b] = a;
	}
	int q;
	cin >> q;
	vector<array<int, 3>> queries(q);
	for (int i = 0; i < q; i++){
		char t; cin >> t;
		int x, y;
		x = t == 'P';
		cin >> y; 
		if (nxt.count(y) == 0){
			nxt[y] = y + 1;
			prv[y + 1] = y;
		}
		if (prv.count(y) == 0){
			prv[y] = y - 1;
			nxt[y - 1] = y;
		}
		queries[i] = {y, x, i};
	}
	sort(all(queries));
	vector<int> ans(q);
	
	int cur = (nxt.count(0) ? nxt[0] : 1);
	int pos = 1;

	for (int i = 0; i < q; i++){
		while (pos < queries[i][0]){
			if (nxt.count(cur)){
				cur = nxt[cur];
				pos++;
			} else {
				int up = nxt.upper_bound(cur)->first;
				pos += up - cur;
				cur = up;
			}
		}
		debug(queries[i], cur, pos);
		ans[queries[i][2]] = cur;
	}
	for (int i = 0; i < q; i++){
		cout << ans[i] << endl;
	}
}

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

queue.cpp: In function 'int main()':
queue.cpp:6:20: warning: statement has no effect [-Wunused-value]
    6 | #define debug(...) 42
      |                    ^~
queue.cpp:78:3: note: in expansion of macro 'debug'
   78 |   debug(queries[i], cur, pos);
      |   ^~~~~

• Subtask 1: 4 / 100