1 条题解
-
0
#include <bits/stdc++.h> using namespace std; int main() { int n,m; cin>>n>>m; vector<pair<int,string>> toys(n); for(int i = 0;i<n;i++) { cin>>toys[i].first>>toys[i].second; } int pos = 0; for(int i = 0;i<m;i++) { int dir,steps; cin>>dir>>steps; if(dir == 0) { if(toys[pos].first == 0) { pos = (pos-steps+n)%n; } else { pos = (pos + steps)%n; } }else { if(toys[pos].first == 0) { pos = (pos + steps) % n; } else { pos = (pos-steps+n)%n; } } } cout << toys[pos].second << endl; return 0; }
信息
- ID
- 5621
- 时间
- 1000ms
- 内存
- 500MiB
- 难度
- 2
- 标签
- 递交数
- 85
- 已通过
- 33
- 上传者