結果
問題 | No.2650 [Cherry 6th Tune *] セイジャク |
ユーザー | AngrySadEight |
提出日時 | 2024-02-23 22:40:01 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 911 ms / 2,500 ms |
コード長 | 3,634 bytes |
コンパイル時間 | 5,517 ms |
コンパイル使用メモリ | 231,752 KB |
実行使用メモリ | 39,116 KB |
最終ジャッジ日時 | 2024-04-27 05:17:16 |
合計ジャッジ時間 | 27,185 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 204 ms
12,160 KB |
testcase_03 | AC | 60 ms
8,192 KB |
testcase_04 | AC | 528 ms
26,724 KB |
testcase_05 | AC | 406 ms
22,564 KB |
testcase_06 | AC | 171 ms
12,928 KB |
testcase_07 | AC | 435 ms
23,956 KB |
testcase_08 | AC | 116 ms
9,728 KB |
testcase_09 | AC | 887 ms
39,036 KB |
testcase_10 | AC | 873 ms
39,116 KB |
testcase_11 | AC | 882 ms
39,064 KB |
testcase_12 | AC | 890 ms
38,916 KB |
testcase_13 | AC | 876 ms
39,096 KB |
testcase_14 | AC | 911 ms
38,924 KB |
testcase_15 | AC | 885 ms
38,884 KB |
testcase_16 | AC | 766 ms
39,036 KB |
testcase_17 | AC | 749 ms
38,968 KB |
testcase_18 | AC | 772 ms
39,076 KB |
testcase_19 | AC | 775 ms
39,084 KB |
testcase_20 | AC | 781 ms
38,984 KB |
testcase_21 | AC | 750 ms
39,096 KB |
testcase_22 | AC | 733 ms
39,036 KB |
testcase_23 | AC | 564 ms
39,056 KB |
testcase_24 | AC | 561 ms
39,072 KB |
testcase_25 | AC | 567 ms
39,036 KB |
testcase_26 | AC | 558 ms
39,068 KB |
testcase_27 | AC | 574 ms
38,992 KB |
testcase_28 | AC | 564 ms
39,116 KB |
testcase_29 | AC | 568 ms
39,028 KB |
testcase_30 | AC | 669 ms
39,116 KB |
testcase_31 | AC | 582 ms
39,108 KB |
testcase_32 | AC | 365 ms
14,336 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <algorithm> #include <atcoder/all> #include <bitset> #include <cassert> #include <cmath> #include <ctime> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int, int> #define pil pair<int, ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int, int>> #define vpll vector<pair<ll, ll>> #define vvpii vector<vector<pair<int, int>>> #define vvpll vector<vector<pair<ll, ll>>> // using mint = modint998244353; template <typename T> void debug(T e) { cerr << e << endl; } template <typename T> void debug(vector<T> &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template <typename T> void debug(vector<vector<T>> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template <typename T> void debug(vector<pair<T, T>> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template <typename T> void debug(set<T> &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(multiset<T> &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(map<T, T> &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } ll op(ll a, ll b){ return max(a, b); } ll e(){ return -1LL; } ll mapping(ll f, ll x){ if (f == -1LL){ return x; } return f; } ll composition(ll f, ll g){ if (f == -1LL){ return g; } return f; } ll id(){ return -1LL; } int main() { ll N, A; cin >> N >> A; vector<ll> X(N); for (ll i = 0; i < N; i++){ cin >> X[i]; } ll T; cin >> T; vector<ll> L(T); vector<ll> R(T); for (ll i = 0; i < T; i++){ cin >> L[i] >> R[i]; } map<ll, ll> mp; for (ll i = 0; i < N; i++){ mp[X[i]]++; } for (ll i = 0; i < T; i++){ mp[L[i]]++; mp[R[i]]++; } ll now = 1; for (auto itr = mp.begin(); itr != mp.end(); itr++){ itr->second = now; now++; } lazy_segtree<ll, op, e, ll, mapping, composition, id> seg(now); for (ll i = 0; i < T; i++){ seg.apply(mp[L[i]], mp[R[i]] + 1, i + 1); } for (ll i = 0; i < N; i++){ cout << seg.get(mp[X[i]]) << endl; } }