帮忙看一眼RE?
查看原帖
帮忙看一眼RE?
589272
__Cow__楼主2022/1/24 20:57

RT,有AC有RE;

RUNOOB 图标

code:

#include <iostream>
#include <string>
#include <algorithm>
#define maxn 9999
int lr[maxn], c[maxn], d[maxn], num = 1, sum = -1;
char name[maxn][maxn];
using namespace std;
int main() {
	int n, m, a, s;
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> lr[i] >> name[i];
	}

	for (int i = 1; i <= m; i++) {
		cin >> a >> s;
		if (lr[num] == 0) {
			if (a == 0) {
				num -= s;
			} else num += s;
		} else {
			if (a == 0) {
				num += s;
			} else num -= s;
		}
		if (num > n) num -= n;
		if (num <= 0) num += n;
	}
	cout << name[num]<<endl;
}

一个奇怪的现象:调大数组后RE变多了!!!

2022/1/24 20:57
加载中...