听取WA声一片
查看原帖
听取WA声一片
1533163
C18924990244楼主2025/7/20 14:30

听取WA声一片听取WA声一片

#include<cstdio>
#include<string>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
const int N=1e5+7;
int n;
int m;
int ans=1;
bool* flag=new bool[N];
string* job=new string[N];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
	scanf("%d ",&n);
    scanf("%d",&m);
	for(int i=1;i<=n;i++)
    {
        int x;
        scanf("%d",&x);
        flag[i]=x;
        cin>>job[i];
    }
	for(int i=1;i<=m;i++)
    {
        int a;
        int s;
		scanf("%d",&a);
        scanf("%d",&s);
		if(a^flag[ans])
        {
            ans=(ans+s)%n;
        }
        else
        {
            ans=(ans+n-s)%n;
        }
        if(ans==0)
        {
            ans=n;
        }
	}
	cout<<job[ans];
    delete[] flag;
    delete[] job;
	return 0;
}
\frac{\frac{}{}}{\frac{}{}}
2025/7/20 14:30
加载中...