Submission #00085
ソースコード
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 | #pragma GCC optimize("O3") #include <bits/extc++.h> using namespace std; #define rep(i,n) for(int i=0;i<(n);++i) #define reps(i,n) for(int i=1;i<=(n);++i) #define all(x) begin(x), end(x) #define Fixed fixed << setprecision(12) #define int int_fast64_t using pii = pair< int , int >; constexpr int32_t INF = 0x3f3f3f3f; constexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr int mod1 = 1e9+7; constexpr int mod2 = 998244353; template < class Func> class FixPoint : Func { public : explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {} template < class ... Args> constexpr decltype(auto) operator()(Args&&... args) const { return Func::operator()(* this , std::forward<Args>(args)...); } }; template < class Func> static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept { return FixPoint<Func>{forward<Func>(f)}; } template < class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true ); } template < class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true ); } template < class T> using max_heap = priority_queue<T>; template < class T> using min_heap = priority_queue<T,vector<T>,greater<T> >; template < class A, class B> using umap = unordered_map<A,B>; template < class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>; template < class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>; template < class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>; template < class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>; using Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>; template < class T> inline void bye(T x) { cout << x << '\n' ; exit (0); } inline int square( int a){ return a * a;} inline int updiv( int a, int b){ return (a + b - 1) / b; } constexpr int dx[] = {1,0,-1,0,1,1,-1,-1}; constexpr int dy[] = {0,-1,0,1,1,-1,-1,1}; signed main( void ){ cin.tie(nullptr); ios_base::sync_with_stdio( false ); int n, c; cin >> n >> c; Set<pair< int , int > > s; for ( int i = 0; i < n; ++i) { s.insert({0, i}); } vector< int > point(n); for ( int i = 0; i < c; ++i) { int com; cin >> com; if (com == 0) { int t, p; cin >> t >> p; --t; auto itr = s.find({point[t], t}); auto [pts, team] = *itr; s.erase(itr); pts -= p; point[t] = pts; s.insert({pts, team}); } else { int m; cin >> m; --m; auto [pts, team] = *s.find_by_order(m); cout << team + 1 << ' ' << -pts << '\n' ; } } return 0; } |
ステータス
項目 | データ |
---|---|
問題 | 0009 - プログラミングコンテスト II |
ユーザー名 | 有象無象 |
投稿日時 | 2021-07-28 09:48:47 |
言語 | C++17 |
状態 | Accepted |
得点 | 18 |
ソースコード長 | 3054 Byte |
最大実行時間 | 167 ms |
最大メモリ使用量 | 10380 KB |
セット
セット | 得点 | Cases | |
---|---|---|---|
1 | ALL | 18 / 18 | * |
テストケース
ファイル名 | 状態 | 実行時間 | メモリ使用量 | # |
---|---|---|---|---|
in01.txt | AC | 18 ms | 476 KB |
1
|
in02.txt | AC | 20 ms | 432 KB |
1
|
in03.txt | AC | 19 ms | 516 KB |
1
|
in04.txt | AC | 20 ms | 472 KB |
1
|
in05.txt | AC | 71 ms | 7588 KB |
1
|
in06.txt | AC | 59 ms | 7552 KB |
1
|
in07.txt | AC | 128 ms | 7896 KB |
1
|
in08.txt | AC | 144 ms | 8480 KB |
1
|
in09.txt | AC | 23 ms | 1384 KB |
1
|
in10.txt | AC | 23 ms | 1340 KB |
1
|
in11.txt | AC | 63 ms | 8464 KB |
1
|
in12.txt | AC | 35 ms | 2148 KB |
1
|
in13.txt | AC | 107 ms | 9264 KB |
1
|
in14.txt | AC | 167 ms | 9348 KB |
1
|
in15.txt | AC | 135 ms | 9304 KB |
1
|
in16.txt | AC | 85 ms | 6188 KB |
1
|
in17.txt | AC | 134 ms | 9660 KB |
1
|
in18.txt | AC | 100 ms | 10380 KB |
1
|
in19.txt | AC | 92 ms | 6744 KB |
1
|
in20.txt | AC | 50 ms | 5104 KB |
1
|
in21.txt | AC | 55 ms | 5472 KB |
1
|
in22.txt | AC | 57 ms | 6716 KB |
1
|
in23.txt | AC | 38 ms | 5784 KB |
1
|
in24.txt | AC | 85 ms | 6976 KB |
1
|