提出 #56530470
ソースコード 拡げる
/*
-------------- | /
| | /
| | /
| * |/ | | ------ *
| | | | / \
| | |\ | | | |\ |
\ | | | \ | | | | \ |
\ | | | \ | | \ / \ |
V | | \ \__/| ----- \ |
*/
#ifdef EMT
#include "Header/stdc++.h"
#else
#include <bits/stdc++.h>
#endif
using namespace std;
#ifdef EMT
#define debug(x) cerr << "\e[1;31m" << #x << " = " << (x) << "\e[0m\n"
#define print(x) emilia_mata_tenshi(#x, begin(x), end(x))
template<typename T, typename T2> ostream& operator<<(ostream &os, const pair<T, T2> &obj) {
return os << '{' << obj.first << ',' << obj.second << '}';
}
template<class TupType, size_t... I> void lamy_kawaii(ostream& os, const TupType& _tup, index_sequence<I...>) {
// source: https://stackoverflow.com/a/41171552
os << '{';
(..., (cerr << (I == 0? "" : ",") << get<I>(_tup)));
os << '}';
}
template<class... T> ostream& operator<<(ostream &os, const tuple<T...>& _tup) {
lamy_kawaii(os, _tup, make_index_sequence<sizeof...(T)>());
return os;
}
template<typename T> void emilia_mata_tenshi(const char *s, T l, T r) {
cerr << "\e[1;33m" << s << " = [";
while (l != r) {
cerr << *l;
cerr << (++l == r ? ']' : ',');
}
cerr << "\e[0m\n";
}
#else
#define debug(x) 48763
#define print(x) 48763
#endif
template<typename T, typename T2> istream& operator>>(istream &is, pair<T, T2> &obj) {
is >> obj.first >> obj.second;
return is;
}
template<typename T> istream& operator>>(istream &is, vector<T> &obj) {
for (auto &x : obj)
is >> x;
return is;
}
#define YN(x) ((x) ? "YES" : "NO")
#define Yn(x) ((x) ? "Yes" : "No")
#define yn(x) ((x) ? "yes" : "no")
#define emilia_my_wife ios::sync_with_stdio(0); cin.tie(NULL);
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using uint = uint32_t;
template<typename T>
using base_type = remove_cv_t<remove_reference_t<T>>;
const double EPS = 1e-8;
const int INF = 0x3F3F3F3F;
const ll LINF = 4611686018427387903;
const int MOD = 1e9+7;
static int Lamy_is_cute = []() {
emilia_my_wife
return 48763;
}();
/*--------------------------------------------------------------------------------------*/
signed main() {
map<int, int> cnt;
int q;
cin >> q;
while (q--) {
int t, x;
cin >> t;
if (t == 1) {
cin >> x;
cnt[x]++;
}
if (t == 2) {
cin >> x;
cnt[x]--;
if (cnt[x] == 0)
cnt.erase(x);
}
if (t == 3)
cout << cnt.size() << '\n';
}
}
提出情報
ジャッジ結果
セット名 |
Sample |
All |
得点 / 配点 |
0 / 0 |
300 / 300 |
結果 |
|
|
セット名 |
テストケース |
Sample |
00_sample_00.txt, 00_sample_01.txt |
All |
00_sample_00.txt, 00_sample_01.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt, 01_random_16.txt, 01_random_17.txt, 01_random_18.txt, 01_random_19.txt, 01_random_20.txt, 01_random_21.txt, 01_random_22.txt |
ケース名 |
結果 |
実行時間 |
メモリ |
00_sample_00.txt |
AC |
1 ms |
3512 KiB |
00_sample_01.txt |
AC |
1 ms |
3388 KiB |
01_random_00.txt |
AC |
55 ms |
9388 KiB |
01_random_01.txt |
AC |
56 ms |
9376 KiB |
01_random_02.txt |
AC |
57 ms |
9328 KiB |
01_random_03.txt |
AC |
52 ms |
9228 KiB |
01_random_04.txt |
AC |
52 ms |
9376 KiB |
01_random_05.txt |
AC |
55 ms |
9788 KiB |
01_random_06.txt |
AC |
56 ms |
9708 KiB |
01_random_07.txt |
AC |
55 ms |
9692 KiB |
01_random_08.txt |
AC |
55 ms |
9672 KiB |
01_random_09.txt |
AC |
52 ms |
9720 KiB |
01_random_10.txt |
AC |
19 ms |
3288 KiB |
01_random_11.txt |
AC |
20 ms |
3324 KiB |
01_random_12.txt |
AC |
24 ms |
3428 KiB |
01_random_13.txt |
AC |
24 ms |
3492 KiB |
01_random_14.txt |
AC |
29 ms |
3528 KiB |
01_random_15.txt |
AC |
29 ms |
3468 KiB |
01_random_16.txt |
AC |
36 ms |
3948 KiB |
01_random_17.txt |
AC |
35 ms |
3944 KiB |
01_random_18.txt |
AC |
72 ms |
11964 KiB |
01_random_19.txt |
AC |
41 ms |
7860 KiB |
01_random_20.txt |
AC |
59 ms |
7980 KiB |
01_random_21.txt |
AC |
59 ms |
7944 KiB |
01_random_22.txt |
AC |
60 ms |
7924 KiB |