0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-25 07:31:59 +00:00
OI-codes/problem/P3613/P3613.cpp
2020-10-13 21:08:38 +08:00

29 lines
611 B
C++

#include<bits/stdc++.h>
using namespace std;
int main() {
map<int, map<int, int> > m;
int n, q, t, i, j, k;
cin >> n >> q;
while(q--) {
cin >> t >> i >> j;
if(t == 1) {
cin >> k;
if(k == 0) {
if(m.count(i) && m[i].count(j)) {
m[i].erase(k);
if(m[i].empty()) {
m.erase(i);
}
}
} else {
m[i][j] = k;
}
} else if(t == 2) {
cout << m[i][j] << endl;
}
}
return 0;
}