제출 #895293

#제출 시각아이디문제언어결과실행 시간메모리
895293Mher777Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
100 / 100
788 ms60196 KiB
/* ----------------------------- Mher777 ----------------------------- */ #define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <iomanip> #include <array> #include <string> #include <algorithm> #include <cmath> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <vector> #include <stack> #include <queue> #include <deque> #include <bitset> #include <list> #include <iterator> #include <numeric> #include <complex> #include <utility> #include <random> #include <fstream> #include <cassert> using namespace std; /* -------------------- Typedefs -------------------- */ typedef int itn; typedef long long ll; typedef unsigned long long ull; typedef float fl; typedef double db; typedef long double ld; /* -------------------- Usings -------------------- */ using vi = vector<int>; using vll = vector<ll>; using mii = map<int, int>; using mll = map<ll, ll>; using pii = pair<int, int>; using pll = pair<ll, ll>; /* -------------------- Defines -------------------- */ #define ff first #define ss second #define pub push_back #define pob pop_back #define puf push_front #define pof pop_front #define mpr make_pair #define yes cout<<"YES\n" #define no cout<<"NO\n" #define all(x) (x).begin(), (x).end() /* -------------------- Constants -------------------- */ const int MAX = int(1e9 + 5); const ll MAXL = ll(1e18 + 5); const ll MOD = ll(1e9 + 7); const ll MOD2 = ll(998244353); /* -------------------- Functions -------------------- */ void fastio() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } void precision(int x) { cout.setf(ios::fixed | ios::showpoint); cout.precision(x); } ll gcd(ll a, ll b) { while (b) { a %= b; swap(a, b); } return a; } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } ll range_sum(ll a, ll b) { ll dif = a - 1, cnt = b - a + 1; ll ans = ((b - a + 1) * (b - a + 2)) / 2; ans += ((b - a + 1) * dif); return ans; } string dec_to_bin(ll a) { string s = ""; for (ll i = a; i > 0; ) { ll k = i % 2; i /= 2; char c = k + 48; s += c; } if (a == 0) { s = "0"; } reverse(all(s)); return s; } ll bin_to_dec(string s) { ll num = 0; for (int i = 0; i < s.size(); i++) { num *= 2ll; num += (s[i] - '0'); } return num; } int isPrime(ll a) { if (a == 1) return 0; for (ll i = 2; i * i <= a; i++) { if (a % i == 0) return 0; } return 1; } ll binpow(ll a, ll b) { if (!a) return 0; ll ans = 1; while (b) { if (b & 1) { ans *= a; } b >>= 1; a *= a; } return ans; } ll binpow_by_mod(ll a, ll b, ll mod) { if (!a) return 0; ll ans = 1; while (b) { if (b & 1) { ans *= a; ans %= mod; } b >>= 1; a *= a; a %= mod; } return ans; } /*-------------------- Solution -------------------- */ const int N = 1000005; int n, m; int a[N], dp[N], t[N * 4], p[N]; void bld(int l = 1, int r = n, int pos = 1) { if (l == r) { p[l] = pos; return; } int mid = (l + r) / 2; bld(l, mid, 2 * pos); bld(mid + 1, r, 2 * pos + 1); } int qry(int l, int r, int tl = 1, int tr = n, int pos = 1) { if (l == tl && r == tr) { return t[pos]; } int mid = (tl + tr) / 2; if (mid >= r) { return qry(l, r, tl, mid, 2 * pos); } if (mid < l) { return qry(l, r, mid + 1, tr, 2 * pos + 1); } return max(qry(l, mid, tl, mid, 2 * pos), qry(mid + 1, r, mid + 1, tr, 2 * pos + 1)); } void upd(int ind, int val) { ind = p[ind]; t[ind] = val; ind /= 2; while (ind) { t[ind] = max(t[ind * 2], t[ind * 2 + 1]); ind /= 2; } } void slv() { cin >> n >> m; for (int i = 1; i <= n; ++i) { cin >> a[i]; int ind = i - 1; while (ind > 0) { if (a[ind] > a[i]) break; ind = dp[ind]; } dp[i] = ind; } bld(); vector<pair<int, pair<int, pii>>> g(m); vi ans(m); for (int i = 0; i < m; ++i) { cin >> g[i].ss.ff >> g[i].ff >> g[i].ss.ss.ff; g[i].ss.ss.ss = i; } sort(all(g)); int cur = 1; for (int i = 0; i < g.size(); ++i) { int l = g[i].ss.ff, r = g[i].ff, k = g[i].ss.ss.ff, id = g[i].ss.ss.ss; while (cur <= r) { upd(dp[cur], a[dp[cur]] + a[cur]); ++cur; } ans[id] = (int)(qry(l, r) <= k); } for (auto elem : ans) cout << elem << '\n'; } void cs() { int tstc = 1; //cin >> tstc; while (tstc--) { slv(); } } void precalc() { return; } int main() { fastio(); precalc(); //precision(0); cs(); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

sortbooks.cpp: In function 'll range_sum(ll, ll)':
sortbooks.cpp:92:21: warning: unused variable 'cnt' [-Wunused-variable]
   92 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
sortbooks.cpp: In function 'll bin_to_dec(std::string)':
sortbooks.cpp:115:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
sortbooks.cpp: In function 'void slv()':
sortbooks.cpp:218:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, std::pair<int, int> > > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  218 |     for (int i = 0; i < g.size(); ++i) {
      |                     ~~^~~~~~~~~~
#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...