AcWing 450. 寻宝
原题链接
简单
作者:
一块两毛五
,
2024-03-26 23:04:25
,
所有人可见
,
阅读 4
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 10010, M = 110;
int sum[N];
int n, m;
int start;
long long res;
struct buildings{
int room_no;
bool stairs;
int value;
}b[N][M];
int main()
{
cin >> n >> m;
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m ;j++)
{
cin >> b[i][j].stairs >> b[i][j].value;
b[i][j].room_no = j;
if(b[i][j].stairs)
sum[i]++;
}
}
cin >> start;
for(int i = 0; i < n; i++)
{
int x = b[i][start].value;
x = (x - 1) % sum[i] + 1;
res = (res + b[i][start].value) % 20123;
int j;
int k;
int cnt = 0;
for(k = 0, j = start ; k < m; k++, j++)
{
if(b[i][j % m].stairs)
cnt++;
if(cnt == x)
break;
}
start = j % m;
}
cout << res;
return 0;
}