P1563 WA95分
  • 板块学术版
  • 楼主Zhang_enze
  • 当前回复2
  • 已保存回复2
  • 发布时间2024/8/6 12:46
  • 上次更新2024/8/6 13:56:21
查看原帖
P1563 WA95分
1415235
Zhang_enze楼主2024/8/6 12:46
#include <iostream>
using namespace std;
int n, m;
int a[100005], b[100005], c[100005];
string s[100005];
int main() {
	cin >> n >> m;
	for (int i = 1; i <= n; i ++) {
		cin >> a[i] >> s[i];
	}
	int idx = 1;
	for (int i = 1; i <= m; i ++) {
		cin >> b[i] >> c[i];
		if (a[idx] == 0) {
			if (b[i] == 1) {
				idx += c[i];
				idx = idx % n;
			} else {
				int tmp = c[i] % n;
				if (tmp < idx) {
					idx -= tmp;
				} else {
					idx = idx - tmp + n;
				}
			}
		} else if (a[idx] == 1){
			if (b[i] == 1) {
				int tmp = c[i] % n;
				if (tmp < idx) {
					idx -= tmp;
				} else {
					idx = idx - tmp + n;
				}
			} else {
				idx += c[i];
				idx = idx % n;
			}
		}
	}
	cout << s[idx];
	return 0;
} 

测试点8没过

2024/8/6 12:46
加载中...