using max_heap = priority_queue
;\ntemplate using min_heap = priority_queue, greater >;\ntemplate using umap = unordered_map;\ntemplate using uset = unordered_set;\n\ntemplate using Max_Heap = __gnu_pbds::priority_queue, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate using Min_Heap = __gnu_pbds::priority_queue, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate using Set = __gnu_pbds::tree, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate using Umap = __gnu_pbds::gp_hash_table;\ntemplate using Rope = __gnu_cxx::rope;\nusing Trie = __gnu_pbds::trie, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate void bye(T x){ cout << x << '\\n'; exit(0); }\ninline int square(int a){ return (a * a); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\n\nsigned main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout.setf(ios_base::fixed);\n cout.precision(12);\n\n int n;\n cin >> n;\n\n assert(1 <= n && n <= 500000);\n\n vector x(n), y(n);\n\n for (int i = 0; i < n; ++i) {\n cin >> x[i] >> y[i];\n assert(0 <= x[i] && x[i] <= i);\n assert(0 <= y[i] && y[i] <= x[i] + 1);\n }\n\n vector cum(n + 1);\n\n for (int i = 1; i <= n; ++i) {\n if (cum[i - 1] - cum[max(0, i - x[i - 1] - 1)] >= y[i - 1]) {\n cum[i] = 1;\n }\n cum[i] += cum[i - 1];\n }\n\n cout << cum[n] << '\\n';\n\n return (0);\n}","accuracy":1,"time_ms":50,"memory_kb":8892,"score_of_the_acc":-0.4629,"final_rank":9},{"submission_id":"aoj_0731_7848633","code_snippet":"#include \n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\n#define codefor int test;scanf(\"%d\",&test);while(test--)\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define yes(ans) if(ans)printf(\"yes\\n\");else printf(\"no\\n\")\n#define Yes(ans) if(ans)printf(\"Yes\\n\");else printf(\"No\\n\")\n#define YES(ans) if(ans)printf(\"YES\\n\");else printf(\"NO\\n\")\n#define popcount(v) __builtin_popcountll(v)\n#define vector2d(type,name,h,...) vector>name(h,vector(__VA_ARGS__))\n#define vector3d(type,name,h,w,...) vector>>name(h,vector>(w,vector(__VA_ARGS__)))\n#define vector4d(type,name,h,w,d,...) vector>>>name(h,vector>>(w,vector>(d,vector(__VA_ARGS__))))\nusing namespace std;\nusing ll = long long;\ntemplate using rpriority_queue = priority_queue, greater>;\nconst int MOD=1000000007;\nconst int MOD2=998244353;\nconst int INF=1<<30;\nconst ll INF2=1LL<<60;\nvoid scan(int& a){scanf(\"%d\",&a);}\nvoid scan(long long& a){scanf(\"%lld\",&a);}\ntemplatevoid scan(pair& p){scan(p.first);scan(p.second);}\ntemplatevoid scan(tuple& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}\ntemplate void scan(array& a){ for(auto&& i : a) scan(i);}\ntemplate void scan(T& a){cin>>a;}\ntemplate void scan(vector& vec){for(auto&& it:vec)scan(it);}\nvoid in(){}\ntemplate void in(Head& head, Tail&... tail){scan(head);in(tail...);}\nvoid print(const int& a){printf(\"%d\",a);}\nvoid print(const long long& a){printf(\"%lld\",a);}\nvoid print(const double& a){printf(\"%.15lf\",a);}\ntemplatevoid print(const pair& p){print(p.first);putchar(' ');print(p.second);}\ntemplate void print(const T& a){cout< void print(const vector& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\nvoid out(){putchar('\\n');}\ntemplate void out(const T& t){print(t);putchar('\\n');}\ntemplate void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\ntemplate void dprint(const T& a){cerr< void dprint(const vector& vec){if(vec.empty())return;cerr< void debug(const T& t){dprint(t);cerr< void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\" \";debug(tail...);}\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\nll updivide(ll a,ll b){return (a+b-1)/b;}\nint msb(ll v){return 63-__builtin_clzll(v);}\ntemplate void chmax(T &a,const T b){if(b>a)a=b;}\ntemplate void chmin(T &a,const T b){if(b struct fenwick_tree {\n using U = T;\n\n public:\n fenwick_tree() : _n(0) {}\n fenwick_tree(int n) : _n(n), data(n) {}\n\n void add(int p, T x) {\n assert(0 <= p && p < _n);\n p++;\n while (p <= _n) {\n data[p - 1] += U(x);\n p += p & -p;\n }\n }\n\n T sum(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n return sum(r) - sum(l);\n }\n\n private:\n int _n;\n std::vector data;\n\n U sum(int r) {\n U s = 0;\n while (r > 0) {\n s += data[r - 1];\n r -= r & -r;\n }\n return s;\n }\n};\n\nint main(){\n INT(n);\n fenwick_tree fw(n);\n for(int i=0;i=y)fw.add(i,1);\n }\n out(fw.sum(0,n));\n}","accuracy":1,"time_ms":70,"memory_kb":4924,"score_of_the_acc":-0.1781,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_0731_10880128\",\n \"code_snippet\": \"#include \\n#include \\n#include \\n#include\\n#include\\n#include\\n#include \\n#include\\n#include