algorithm
This documentation is automatically generated by online-judge-tools/verification-helper
test/aoj/0343.test.cpp
- View this file on GitHub
- Last update: 2026-01-01 00:55:00+09:00
- Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0343
Depends on
Code
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0343"
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
if (t < u) t = u;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
#define call_from_test
#include "../../cpp_src/data_structure/FenwickTree.hpp"
#undef call_from_test
int main() {
int N, C;
cin >> N >> C;
V<ll> tp(C), t(C), p(C);
V<pair<ll, ll>> pt;
rep(i, N) pt.eb(0, -i);
V<ll> sc(N);
rep(i, C) {
cin >> tp[i];
if (tp[i] == 0) {
cin >> t[i] >> p[i];
--t[i];
sc[t[i]] += p[i];
pt.eb(sc[t[i]], -t[i]);
} else {
cin >> t[i];
}
}
sort(ALL(pt));
int sz = SZ(pt);
BIT<ll> T(sz);
fill(ALL(sc), 0);
rep(i, N) {
int pos = lower_bound(ALL(pt), mp(0ll, ll(-i))) - pt.begin();
T.add(pos, 1);
}
rep(i, C) {
if (tp[i] == 0) {
int pos = lower_bound(ALL(pt), mp(sc[t[i]], -t[i])) - pt.begin();
T.add(pos, -1);
sc[t[i]] += p[i];
pos = lower_bound(ALL(pt), mp(sc[t[i]], -t[i])) - pt.begin();
T.add(pos, 1);
} else {
int pos = T.lower_bound(N + 1 - t[i]);
cout << -pt[pos - 1].se + 1 << ' ' << pt[pos - 1].fi << '\n';
}
}
return 0;
}#line 1 "test/aoj/0343.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0343"
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
if (t < u) t = u;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
#define call_from_test
#line 1 "cpp_src/data_structure/FenwickTree.hpp"
template <class T>
struct BIT {
int n;
vector<T> bit;
BIT(int _n = 0) : n(_n), bit(n + 1) {}
// ABC368G
BIT(const V<T>& vec) : n(SZ(vec)), bit(n + 1) {
rep(i, n) bit[i + 1] = vec[i];
for (int i = 1; i <= n; ++i) {
int j = i + (i & -i);
if (j <= n) {
bit[j] += bit[i];
}
}
}
// sum of [0, i), 0 <= i <= n
T sum(int i) {
T s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
// 0 <= i < n
void add(int i, T x) {
++i;
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
//[l, r) 0 <= l < r < n
T sum(int l, int r) { return sum(r) - sum(l); }
// ABC392F, ARC197C
// smallest i, sum(i) >= w, none -> n + 1
int lower_bound(T w) {
if (w <= 0) return 0;
int x = 0, l = 1;
while (l * 2 <= n) l *= 2;
for (int k = l; k > 0; k /= 2) {
if (x + k <= n && bit[x + k] < w) {
w -= bit[x + k];
x += k;
}
}
return x + 1;
}
// ABC380G
V<T> recover() {
V<T> res(n);
rep(i, n) res[i] = sum(i, i + 1);
return res;
}
};
#line 119 "test/aoj/0343.test.cpp"
#undef call_from_test
int main() {
int N, C;
cin >> N >> C;
V<ll> tp(C), t(C), p(C);
V<pair<ll, ll>> pt;
rep(i, N) pt.eb(0, -i);
V<ll> sc(N);
rep(i, C) {
cin >> tp[i];
if (tp[i] == 0) {
cin >> t[i] >> p[i];
--t[i];
sc[t[i]] += p[i];
pt.eb(sc[t[i]], -t[i]);
} else {
cin >> t[i];
}
}
sort(ALL(pt));
int sz = SZ(pt);
BIT<ll> T(sz);
fill(ALL(sc), 0);
rep(i, N) {
int pos = lower_bound(ALL(pt), mp(0ll, ll(-i))) - pt.begin();
T.add(pos, 1);
}
rep(i, C) {
if (tp[i] == 0) {
int pos = lower_bound(ALL(pt), mp(sc[t[i]], -t[i])) - pt.begin();
T.add(pos, -1);
sc[t[i]] += p[i];
pos = lower_bound(ALL(pt), mp(sc[t[i]], -t[i])) - pt.begin();
T.add(pos, 1);
} else {
int pos = T.lower_bound(N + 1 - t[i]);
cout << -pt[pos - 1].se + 1 << ' ' << pt[pos - 1].fi << '\n';
}
}
return 0;
}