Submission #905761

#TimeUsernameProblemLanguageResultExecution timeMemory
905761Der_VlaposRed-blue table (IZhO19_stones)C++17
0 / 100
1 ms356 KiB
// #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #include <x86intrin.h> #include <bits/stdc++.h> #include <chrono> #include <random> // @author: Vlapos namespace operators { template <typename T1, typename T2> std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x) { in >> x.first >> x.second; return in; } template <typename T1, typename T2> std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x) { out << x.first << " " << x.second; return out; } template <typename T1> std::istream &operator>>(std::istream &in, std::vector<T1> &x) { for (auto &i : x) in >> i; return in; } template <typename T1> std::ostream &operator<<(std::ostream &out, std::vector<T1> &x) { for (auto &i : x) out << i << " "; return out; } template <typename T1> std::ostream &operator<<(std::ostream &out, std::set<T1> &x) { for (auto &i : x) out << i << " "; return out; } } // name spaces using namespace std; using namespace operators; // end of name spaces // defines #define ll long long #define ull unsigned long long #define pb push_back #define mp make_pair #define pii pair<int, int> #define pll pair<ll, ll> #define f first #define s second #define uint unsigned int #define all(vc) vc.begin(), vc.end() // end of defines // usefull stuff void boost() { ios_base ::sync_with_stdio(false); cin.tie(0); cout.tie(0); } inline int getbit(int &x, int &bt) { return (x >> bt) & 1; } const int dx4[4] = {-1, 0, 0, 1}; const int dy4[4] = {0, -1, 1, 0}; const int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1}; const int dy8[8] = {-1, -0, 1, -1, 1, -1, 0, 1}; const ll INF = (1e18) + 500; const int BIG = (1e9) * 2 + 100; const int MAXN = (1e5) + 5; const int MOD7 = (1e9) + 7; const int MOD9 = (1e9) + 9; const uint MODFFT = 998244353; // #define int ll struct segTree { vector<int> tree; int sz = 0; void init(int n) { sz = n; tree.resize(2 * sz, 0); } void set(int pos, int val) { pos += sz; tree[pos] = max(tree[pos], val); pos >>= 1; while (pos) { tree[pos] = max(tree[pos * 2], tree[pos * 2 + 1]); pos >>= 1; } } int get(int l, int r) { l += sz; r += sz; int res = 0; while (l < r) { if (l & 1) res = max(res, tree[l++]); if (r & 1) res = max(res, tree[--r]); l >>= 1; r >>= 1; } return res; } }; struct test { struct query { int l, k, id; }; void solve(int testcase) { boost(); int n, m; cin >> n >> m; if(n > 1000) exit(0); vector<int> a(n); cin >> a; vector<vector<query>> qrs(n); for (int i = 0; i < m; ++i) { int l, r, k; cin >> l >> r >> k; --l, --r; qrs[r].pb({l, k, i}); } vector<int> ans(m); stack<int> vals; segTree tree; tree.init(n); stack<int> poses; for (int i = 0; i < n; ++i) { while (poses.size() and a[poses.top()] <= a[i]) poses.pop(); if (poses.size()) { int el = poses.top(); tree.set(el, a[i] + a[el]); } for (auto q : qrs[i]) { int res = tree.get(q.l, i + 1); ans[q.id] = (int)(q.k >= res); } exit(0); poses.push(i); } cout << ans << "\n"; } }; main() { boost(); int q = 1; // cin >> q; for (int i = 0; i < q; i++) { test t; t.solve(i); } return 0; } //[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]// // // // Coded by Der_Vlἀpos // // // //[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//

Compilation message (stderr)

stones.cpp:194:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  194 | main()
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...