#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
int vmax;
struct node{
vi nxt;
node(){
nxt.resize(vmax + 1);
REP(i, vmax + 1) nxt[i] = i;
}
void apply(int l, int r, ll val){
if(val == 1){
REP(i, vmax + 1){
nxt[i] = min(vmax, i + 1);
}
}
else{
REP(i, vmax + 1){
nxt[i] = max(0, i - 1);
}
}
}
};
struct segtree{
node comb(node const &a, node const &b){
node res;
REP(i, vmax + 1){
res.nxt[i] = b.nxt[a.nxt[i]];
}
return res;
}
void push(int l, int r, int v){
}
int sz;
vector<node> tree;
segtree(int _sz){ // tree is resized to default values set in node
sz = 1; while(sz < _sz) sz<<=1;
tree.resize(2*sz);
}
void build(vector<node> &init){
for(int i = 0; i < sz; ++i)
if(i < init.size())
tree[i+sz] = init[i];
for(int i = sz-1; i > 0; --i)
tree[i] = comb(tree[i<<1], tree[i<<1|1]);
}
node query(int l, int r){return query0(l, r, 0, sz, 1);}
node query0(int l, int r, int beg, int end, int v){
if(beg >= l && end <= r)
return tree[v];
push(beg, end, v);
int mid = (beg + end) >> 1;
node res;
if(beg >= r || mid <= l) res = query0(l, r, mid, end, v<<1|1); //[beg, mid]
else if(mid >= r || end <= l) res = query0(l, r, beg, mid, v<<1);
else res = comb(query0(l, r, beg, mid, v<<1), query0(l, r, mid, end, v<<1|1));
return res;
}
template<typename... T>
void upd(int l, int r, T ...args){upd0(l, r, 0, sz, 1, args...);}
template<typename... T>
void upd0(int l, int r, int beg, int end, int v, T ...args){
if(beg >= r || end <= l)
return;
if(beg >= l && end <= r){
tree[v].apply(beg, end, args...);
return;
}
push(beg, end, v);
int mid = (beg + end) >> 1;
upd0(l, r, beg, mid, v<<1, args...);
upd0(l, r, mid, end, v<<1|1, args...);
tree[v] = comb(tree[v<<1], tree[v<<1|1]);
}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n, v2;
cin >> n >> vmax >> v2;
vector<pair<int, int>> a(n);
REP(i, n){
char x; cin >> x;
if(x == '+') a[i].ff = 1;
else a[i].ff = -1;
cin >> a[i].ss;
}
FORD(i, n - 1, 1, 1)
a[i].ss = a[i].ss - a[i - 1].ss;
a[0].ss = 2 * INF + 25;
segtree st(n);
vector<array<int, 3>> evs(n);
REP(i, n){
evs[i] = {a[i].ss, i, a[i].ff};
}
sort(all(evs));
vi event_times;
REP(i, n){
event_times.pb(evs[i][0] - 1);
}
event_times.pb(2 * INF + 17);
int pp = 0;
int resT = 0;
int resV0 = v2;
for(int e : event_times){
while(pp < evs.size() && evs[pp][0] <= e){
st.upd(evs[pp][1], evs[pp][1] + 1, evs[pp][2]);
pp++;
}
auto no = st.query(0, n);
int cmax = -1;
REP(i, no.nxt.size()){
if(no.nxt[i] == v2)
cmax = max(cmax, i);
}
if(cmax != -1){
resT = e;
resV0 = cmax;
}
}
if(resT == 2 * INF + 17){
cout << "infinity" << "\n";
}
else{
cout << resT << " " << resV0 << "\n";
}
return 0;
}
Compilation message
mp3player.cpp: In member function 'void segtree::build(std::vector<node>&)':
mp3player.cpp:121:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
121 | if(i < init.size())
| ~~^~~~~~~~~~~~~
mp3player.cpp: In function 'int main()':
mp3player.cpp:187:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
187 | while(pp < evs.size() && evs[pp][0] <= e){
| ~~~^~~~~~~~~~~~
mp3player.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
| ^
mp3player.cpp:28:18: note: in expansion of macro 'FOR'
28 | #define REP(i,b) FOR(i,0,b,1)
| ^~~
mp3player.cpp:193:9: note: in expansion of macro 'REP'
193 | REP(i, no.nxt.size()){
| ^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
492 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
22 ms |
3308 KB |
Output is correct |
| 2 |
Correct |
21 ms |
3308 KB |
Output is correct |
| 3 |
Correct |
5 ms |
876 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
30 ms |
4588 KB |
Output is correct |
| 2 |
Correct |
44 ms |
4716 KB |
Output is correct |
| 3 |
Correct |
40 ms |
4660 KB |
Output is correct |
| 4 |
Correct |
5 ms |
620 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
440 ms |
52204 KB |
Output is correct |
| 2 |
Correct |
8 ms |
1004 KB |
Output is correct |
| 3 |
Correct |
8 ms |
876 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
72 ms |
5868 KB |
Output is correct |
| 2 |
Correct |
56 ms |
4844 KB |
Output is correct |
| 3 |
Correct |
56 ms |
4844 KB |
Output is correct |
| 4 |
Correct |
50 ms |
6144 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
66 ms |
4972 KB |
Output is correct |
| 2 |
Correct |
64 ms |
5028 KB |
Output is correct |
| 3 |
Correct |
60 ms |
4972 KB |
Output is correct |
| 4 |
Correct |
63 ms |
4972 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
81 ms |
5100 KB |
Output is correct |
| 2 |
Correct |
81 ms |
5216 KB |
Output is correct |
| 3 |
Correct |
91 ms |
9072 KB |
Output is correct |
| 4 |
Correct |
69 ms |
4972 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
160 ms |
9328 KB |
Output is correct |
| 2 |
Correct |
125 ms |
9324 KB |
Output is correct |
| 3 |
Correct |
90 ms |
9220 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
244 ms |
262148 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
217 ms |
262148 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
