結果

問題 No.1705 Mode of long array
ユーザー Ricky_pon
提出日時 2021-10-08 22:50:14
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 320 ms / 3,000 ms
コード長 2,333 bytes
コンパイル時間 2,133 ms
コンパイル使用メモリ 209,356 KB
最終ジャッジ日時 2025-01-24 23:03:37
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 51
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:84:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   84 |     scanf("%lld%lld", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~
main.cpp:90:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   90 |         scanf("%lld", &a);
      |         ~~~~~^~~~~~~~~~~~
main.cpp:96:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   96 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
main.cpp:100:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  100 |         scanf("%d%lld%lld", &t, &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/modint>
#include <algorithm>
#include <cassert>
#include <vector>
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
T div_floor(T a, T b) {
if (b < 0) a *= -1, b *= -1;
return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
if (b < 0) a *= -1, b *= -1;
return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <typename T>
struct CoordComp {
std::vector<T> v;
bool sorted;
CoordComp() : sorted(false) {}
int size() { return v.size(); }
void add(T x) { v.push_back(x); }
void build() {
std::sort(v.begin(), v.end());
v.erase(std::unique(v.begin(), v.end()), v.end());
sorted = true;
}
int get_idx(T x) {
assert(sorted);
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
T &operator[](int i) { return v[i]; }
};
#define For(i, a, b) for (int i = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For(i, 0, n)
#define rrep(i, n) rFor(i, n, 0)
#define fi first
#define se second
using namespace std;
using lint = long long;
using pii = pair<int, int>;
using pll = pair<lint, lint>;
using namespace atcoder;
using mint = modint1000000007;
int main() {
lint n, m;
scanf("%lld%lld", &n, &m);
map<lint, lint> mp;
auto cmp = [](const pll &p1, const pll &p2) { return p1 > p2; };
set<pll, decltype(cmp)> S(cmp);
rep(i, m) {
lint a;
scanf("%lld", &a);
mp[i + 1] = a;
S.emplace(a, i + 1);
}
int q;
scanf("%d", &q);
rep(i, q) {
int t;
lint x, y;
scanf("%d%lld%lld", &t, &x, &y);
if (t == 1) {
auto tmp = mp[x];
mp[x] = tmp + y;
S.erase({tmp, x});
S.emplace(tmp + y, x);
} else if (t == 2) {
auto tmp = mp[x];
mp[x] = tmp - y;
S.erase({tmp, x});
S.emplace(tmp - y, x);
} else {
printf("%lld\n", S.begin()->se);
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0