제출 #962365

#제출 시각아이디문제언어결과실행 시간메모리
962365Mher777Event Hopping (BOI22_events)C++17
0 / 100
224 ms55828 KiB
#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 <cassert> #include <fstream> using namespace std; mt19937 rnd(7069); /* -------------------- Typedefs -------------------- */ typedef int itn; typedef long long ll; typedef unsigned long long ull; typedef double db; typedef float fl; 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() #define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout); /* -------------------- Constants -------------------- */ const int MAX = int(1e9 + 5); const ll MAXL = ll(1e18) + 5ll; const ll MOD = ll(998244353); 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) { if (a == 0 || b == 0) return(max(a, 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) { if (a > b) return 0ll; 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; } ll factorial_by_mod(ll n, ll mod) { ll ans = 1; ll num; for (ll i = 1; i <= n; ++i) { num = i % mod; ans *= num; ans %= mod; } return ans; } 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 = 100005, M = 200005, K = 30; int a[M], t_max[M * 4], lx[M], st[M]; ll t[M * 4], ran[M * 4]; vector<pii> g[M]; pll lazy[M * 4]; pii b[N]; mii pox; int n, q, m; void prop(int pos) { if (lazy[pos].ff) { t[2 * pos] = ran[2 * pos] * (lazy[pos].ff + lazy[pos].ss); t[2 * pos + 1] = ran[2 * pos + 1] * (lazy[pos].ff + lazy[pos].ss); lazy[2 * pos] = lazy[2 * pos + 1] = lazy[pos]; } else if (lazy[pos].ss) { t[2 * pos] += ran[2 * pos] * lazy[pos].ss; t[2 * pos + 1] += ran[2 * pos + 1] * lazy[pos].ss; lazy[2 * pos].ss += lazy[pos].ss; lazy[2 * pos + 1].ss += lazy[pos].ss; } lazy[pos] = { 0,0 }; } void bld(int l = 1, int r = m, int pos = 1) { t[pos] = (ll)MAX; ran[pos] = (ll)(r - l + 1); if (l == r) { t_max[pos] = st[l]; return; } int mid = (l + r) / 2; bld(l, mid, 2 * pos); bld(mid + 1, r, 2 * pos + 1); t[pos] = t[2 * pos] + t[2 * pos + 1]; t_max[pos] = max(t_max[2 * pos], t_max[2 * pos + 1]); } int qry_max(int l, int r, int tl = 1, int tr = m, int pos = 1) { if (l == tl && r == tr) { return t_max[pos]; } int mid = (tl + tr) / 2; if (mid >= r) { return qry_max(l, r, tl, mid, 2 * pos); } if (mid < l) { return qry_max(l, r, mid + 1, tr, 2 * pos + 1); } return max(qry_max(l, mid, tl, mid, 2 * pos), qry_max(mid + 1, r, mid + 1, tr, 2 * pos + 1)); } ll qry(int l, int r, int tl = 1, int tr = m, int pos = 1) { if (l > r) return (ll)MAX; if (l == tl && r == tr) { return t[pos]; } prop(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 qry(l, mid, tl, mid, 2 * pos) + qry(mid + 1, r, mid + 1, tr, 2 * pos + 1); } void upd(int l, int r, int type, ll val, int tl = 1, int tr = m, int pos = 1) { if (l > r) return; if (l == tl && r == tr) { if (type == 1) { t[pos] += val * ran[pos]; lazy[pos].ss += val; } else { t[pos] = val * ran[pos]; lazy[pos] = { val,0 }; } return; } prop(pos); int mid = (tl + tr) / 2; if (mid >= r) { upd(l, r, type, val, tl, mid, 2 * pos); } else if (mid < l) { upd(l, r, type, val, mid + 1, tr, 2 * pos + 1); } else { upd(l, mid, type, val, tl, mid, 2 * pos); upd(mid + 1, r, type, val, mid + 1, tr, 2 * pos + 1); } t[pos] = t[2 * pos] + t[2 * pos + 1]; } void slv() { cin >> n >> q; set<int> stx; for (int i = 1; i <= n; ++i) { cin >> b[i].ff >> b[i].ss; stx.insert(b[i].ff); stx.insert(b[i].ss); } for (auto elem : stx) { pox[elem] = ++m; } int l = log2(m); for (int i = 1; i <= n; ++i) { b[i].ff = pox[b[i].ff]; b[i].ss = pox[b[i].ss]; lx[b[i].ss] = b[i].ff; a[b[i].ff] = b[i].ss; } for (int i = 1; i <= m; ++i) { st[i] = a[i]; } bld(); vector<pii> harc(q + 1); vi ans(q + 1); for (int i = 1; i <= q; ++i) { cin >> harc[i].ff >> harc[i].ss; g[b[harc[i].ff].ss].pub({ b[harc[i].ss].ss,i }); } for (int i = m; i >= 1; --i) { if (!lx[i]) continue; int till = qry_max(lx[i], i); upd(i, i, 2, 0); upd(i + 1, till, 2, 1); upd(till + 1, m, 1, 1); for (auto har : g[i]) { ans[har.ss] = qry(har.ff, har.ff); } } for (int i = 1; i <= q; ++i) { if (ans[i] >= MAX) { cout << "impossible\n"; } else { cout << ans[i] << '\n'; } } } void cs() { int tstc = 1; //cin >> tstc; while (tstc--) { slv(); } } void precalc() { return; } int main() { fastio(); precalc(); //precision(0); cs(); return 0; }

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

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