洛谷 P3613 【深基15.例2】寄包柜 存储格式

原题链接在这里~~

一维map

#include <bits/stdc++.h>

using namespace std;

const int N = 123456;

int main()
{
	map<long long, int> mp;
	
	int n, m;
	cin >> n >> m;
	
	for (int o = 1; o <= m; o ++ )
	{
		int y, i, j;
		cin >> y >> i >> j;
		
		if (y == 1)
		{
			int k;
			cin >> k;
			
			
			mp[i * N + j] = k;
		 } 
		else
			cout << mp[i * N + j] << endl;
	} 
	
	return 0;
}

二维map

#include <bits/stdc++.h>

using namespace std;

const int N = 123456;

map <pair<int,int>,int> mp; // 2、map <int, map<int, int>> mp,注意先后顺序

int main()
{
	int n, m;
	cin >> n >> m;
	
	for (int o = 1; o <= m; o ++ )
	{
		int y, i, j, k;
		cin >> y >> i >> j;
		
		if (y == 1)
		{
			cin >> k;
			
			mp[{i, j}] = k; // 如果用第二种，格式为mp[i][j] = k;
		}
		else
			cout << mp[{i, j}] << endl;
	}
	
	return 0;
}