結果
問題 | No.1705 Mode of long array |
ユーザー | Aoxiang Cui |
提出日時 | 2021-10-08 22:46:20 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 186 ms / 3,000 ms |
コード長 | 3,809 bytes |
コンパイル時間 | 1,455 ms |
コンパイル使用メモリ | 124,356 KB |
実行使用メモリ | 10,368 KB |
最終ジャッジ日時 | 2024-07-23 05:53:28 |
合計ジャッジ時間 | 8,041 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 3 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,948 KB |
testcase_05 | AC | 3 ms
6,940 KB |
testcase_06 | AC | 5 ms
6,940 KB |
testcase_07 | AC | 6 ms
6,944 KB |
testcase_08 | AC | 6 ms
6,944 KB |
testcase_09 | AC | 6 ms
6,940 KB |
testcase_10 | AC | 5 ms
6,940 KB |
testcase_11 | AC | 5 ms
6,940 KB |
testcase_12 | AC | 5 ms
6,940 KB |
testcase_13 | AC | 103 ms
8,832 KB |
testcase_14 | AC | 66 ms
6,944 KB |
testcase_15 | AC | 51 ms
6,944 KB |
testcase_16 | AC | 66 ms
6,940 KB |
testcase_17 | AC | 45 ms
6,940 KB |
testcase_18 | AC | 38 ms
6,944 KB |
testcase_19 | AC | 83 ms
6,944 KB |
testcase_20 | AC | 49 ms
6,940 KB |
testcase_21 | AC | 80 ms
8,064 KB |
testcase_22 | AC | 131 ms
9,728 KB |
testcase_23 | AC | 53 ms
6,944 KB |
testcase_24 | AC | 53 ms
6,940 KB |
testcase_25 | AC | 53 ms
6,944 KB |
testcase_26 | AC | 53 ms
6,944 KB |
testcase_27 | AC | 54 ms
6,944 KB |
testcase_28 | AC | 54 ms
6,944 KB |
testcase_29 | AC | 53 ms
6,940 KB |
testcase_30 | AC | 54 ms
6,940 KB |
testcase_31 | AC | 53 ms
6,944 KB |
testcase_32 | AC | 53 ms
6,940 KB |
testcase_33 | AC | 186 ms
10,112 KB |
testcase_34 | AC | 176 ms
10,368 KB |
testcase_35 | AC | 166 ms
10,240 KB |
testcase_36 | AC | 165 ms
10,112 KB |
testcase_37 | AC | 166 ms
10,240 KB |
testcase_38 | AC | 181 ms
10,240 KB |
testcase_39 | AC | 167 ms
10,112 KB |
testcase_40 | AC | 169 ms
10,240 KB |
testcase_41 | AC | 172 ms
10,240 KB |
testcase_42 | AC | 172 ms
10,240 KB |
testcase_43 | AC | 65 ms
10,240 KB |
testcase_44 | AC | 65 ms
10,112 KB |
testcase_45 | AC | 65 ms
10,240 KB |
testcase_46 | AC | 66 ms
10,112 KB |
testcase_47 | AC | 65 ms
10,368 KB |
testcase_48 | AC | 65 ms
10,368 KB |
testcase_49 | AC | 115 ms
10,240 KB |
testcase_50 | AC | 119 ms
10,240 KB |
testcase_51 | AC | 127 ms
10,240 KB |
testcase_52 | AC | 119 ms
10,112 KB |
testcase_53 | AC | 117 ms
10,240 KB |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:126:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 126 | auto [ret, k] = *A.begin(); | ^
ソースコード
#define LOCAL #define _USE_MATH_DEFINES #include <array> #include <cassert> #include <cstdio> #include <cstring> #include <iostream> #include <iomanip> #include <string> #include <sstream> #include <vector> #include <queue> #include <stack> #include <list> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <algorithm> #include <complex> #include <cmath> #include <numeric> #include <bitset> #include <functional> #include <random> #include <ctime> using namespace std; template <typename A, typename B> ostream& operator <<(ostream& out, const pair<A, B>& a) { out << "(" << a.first << "," << a.second << ")"; return out; } template <typename T, size_t N> ostream& operator <<(ostream& out, const array<T, N>& a) { out << "["; bool first = true; for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]"; return out; } template <typename T> ostream& operator <<(ostream& out, const vector<T>& a) { out << "["; bool first = true; for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]"; return out; } template <typename T, class Cmp> ostream& operator <<(ostream& out, const set<T, Cmp>& a) { out << "{"; bool first = true; for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}"; return out; } template <typename U, typename T, class Cmp> ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) { out << "{"; bool first = true; for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}"; return out; } #ifdef LOCAL #define trace(...) __f(#__VA_ARGS__, __VA_ARGS__) #else #define trace(...) 42 #endif template <typename Arg1> void __f(const char* name, Arg1&& arg1){ cerr << name << ": " << arg1 << endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args){ const char* comma = strchr(names + 1, ','); cerr.write(names, comma - names) << ": " << arg1 << " |"; __f(comma + 1, args...); } template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); } template <class T, class... D> auto vect(const T& v, int n, D... m) { return vector<decltype(vect(v, m...))>(n, vect(v, m...)); } typedef long long int64; typedef pair<int, int> ii; #define SZ(x) (int)((x).size()) template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2; const int MOD = 1e9 + 7; // const int MOD = 998244353; mt19937 mrand(random_device{}()); int rnd(int x) { return mrand() % x; } // mt19937_64 mrand(random_device{}()); // int64 rnd(int64 x) { return mrand() % x; } template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; } template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); } void add(int& x, int y) { x += y; if (x >= MOD) x -= MOD; } struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); }; } fast_ios_; int main() { int64 n, m; cin >> n >> m; vector<int64> a(m); for (auto& x : a) cin >> x; int q; cin >> q; set<array<int64, 2>, greater<array<int64, 2>>> A; for (int i = 0; i < m; ++i) A.insert({a[i], i}); while (q--) { int64 op, x, y; cin >> op >> x >> y; --x; if (op == 1) { A.erase({a[x], x}); a[x] += y; A.insert({a[x], x}); } else if (op == 2) { A.erase({a[x], x}); a[x] -= y; A.insert({a[x], x}); } else { auto [ret, k] = *A.begin(); cout << k + 1 << '\n'; } } return 0; }