与排第一的题解方法一致但是全部RE
查看原帖
与排第一的题解方法一致但是全部RE
400618
realec楼主2021/10/28 21:46
#include <iostream>
#include <vector>
using namespace std;
struct cabinet
{
	vector <int> id,item;
	int num = -1;
}cab [10005];
int main ()
{
	int n,q;
	cin >> n >> q;
	while (q--)
	{
		int t ;
		cin >> t;
		int i , j , k;
		if (t == 1)
		{
			cin >> i >> j >> k;
			cab[i].num ++;
			cab[i].id.push_back(j);
			cab[i].item.push_back(k);
		}
		else if (t == 2)
		{
			cin >> i >> j;
			for (int ii = cab[i].num ; ii >= 0  ;--ii )
			{
				if (cab[i].id[ii] == j )
				{
					cout << cab[i].item[ii] << endl;
					break;
				}
			}
		}
	}
}
2021/10/28 21:46
加载中...