Submission #15320

#	Time	Username	Problem	Language	Result	Execution time	Memory
15320		sujin	통로 위의 개미 (kriii3_X)	C++98	30 / 85	3000 ms	1344 KiB

X

#define _CRT_SECURE_NO_WARNINGS

#include <stdio.h>
#include <algorithm>
#include <vector>
#include <list>

#define PII pair<int, int> 

using namespace std;

int main(){
	list<int> a;
	vector<PII> v;
	long long pt = 0;
	int n = 0;

	int L, Q;
	scanf("%d %d", &L, &Q);
	a.push_back(0);

	while (Q--){
		long long t;
		int p;
		scanf("%lld %d", &t, &p);

		long long mt = t - pt;
		pt = t;
		for (int i = 0; i < n; i++){
			v[i].first = (mt / L % 2 ? L - v[i].first : v[i].first)
				+ ((mt / L % 2 ? -1 : 1) * v[i].second * mt % L);
			v[i].second *= (mt / L % 2 ? -1 : 1);
			if (v[i].first < 0){
				v[i].first = -v[i].first;
				v[i].second = -v[i].second;
			}
			if (v[i].first > L){
				v[i].first = 2 * L - v[i].first;
				v[i].second = -v[i].second;
			}
		}
		sort(v.begin(), v.end());

		if (p == 1){
			int x, d, j = 0;
			scanf("%d %d", &x, &d);
			for (list<int>::iterator it = a.begin(); it != a.end(); it++, j++){
				if (j >= v.size() || v[j].first > x){
					a.insert(it, ++n);
					break;
				}
			}
			v.push_back(PII(x, d));
		}
		else{
			int i, j = 0;
			scanf("%d", &i);
			for (list<int>::iterator it = a.begin(); it != a.end(); it++, j++)
				if ((*it) == i)
					break;
			printf("%d\n", v[j].first);
		}
	}

	return 0;
}

• Subtask 1: 30 / 30
• Subtask 2: 0 / 55