/* -------------------- Includes -------------------- */
#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>
#pragma warning(disable : 4996)
#pragma warning(disable : 6031)
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 = 100005, M = 50;
int dp[N], l;
pair<int, ll> a[N], up[N][M];
vi g[N];
void dfs(int u, int p = 0) {
up[u][0] = { p,a[u].ss };
for (int i = 1; i <= l; i++) {
up[u][i] = { up[up[u][i - 1].ff][i - 1].ff, up[u][i - 1].ss + up[up[u][i - 1].ff][i - 1].ss };
}
for (auto to : g[u]) {
dfs(to, u);
}
}
int get(int ind, ll val) {
for (int i = l; i >= 0; i--) {
if (val > up[ind][i].ss) {
val -= up[ind][i].ss;
ind = up[ind][i].ff;
}
}
return ind;
}
void slv() {
int n, q;
cin >> n >> q;
l = log2(n);
for (int i = 1; i <= n; i++) {
cin >> a[i].ff >> a[i].ss;
}
dp[n] = -1;
for (int i = n - 1; i > 0; i--) {
if (a[i + 1].ff > a[i].ff) {
dp[i] = i + 1;
}
else {
int i1 = i + 1;
while (dp[i1] != -1 && a[dp[i1]].ff <= a[i].ff) {
i1 = dp[i1];
}
dp[i] = dp[i1];
}
if (dp[i] != -1) g[dp[i]].pub(i);
}
for (int i = 1; i <= n; i++) {
if (dp[i] == -1) dfs(i);
}
while (q--) {
int ind;
ll val;
cin >> ind >> val;
cout << get(ind, val) << '\n';
}
}
void cs() {
int tstc = 1;
//cin >> tstc;
while (tstc--) {
slv();
}
}
void precalc() {
return;
}
int main() {
fastio();
precalc();
precision(0);
cs();
return 0;
}
Compilation message
fountain.cpp:24: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
24 | #pragma warning(disable : 4996)
|
fountain.cpp:25: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
25 | #pragma warning(disable : 6031)
|
fountain.cpp: In function 'll range_sum(ll, ll)':
fountain.cpp:92:21: warning: unused variable 'cnt' [-Wunused-variable]
92 | ll dif = a - 1, cnt = b - a + 1;
| ^~~
fountain.cpp: In function 'll bin_to_dec(std::string)':
fountain.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++) {
| ~~^~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
6748 KB |
Output is correct |
| 2 |
Correct |
1 ms |
6812 KB |
Output is correct |
| 3 |
Correct |
2 ms |
6748 KB |
Output is correct |
| 4 |
Correct |
2 ms |
6748 KB |
Output is correct |
| 5 |
Correct |
2 ms |
6748 KB |
Output is correct |
| 6 |
Correct |
2 ms |
6808 KB |
Output is correct |
| 7 |
Correct |
2 ms |
6748 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
164 ms |
89420 KB |
Output is correct |
| 2 |
Correct |
171 ms |
82772 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
6748 KB |
Output is correct |
| 2 |
Correct |
1 ms |
6812 KB |
Output is correct |
| 3 |
Correct |
2 ms |
6748 KB |
Output is correct |
| 4 |
Correct |
2 ms |
6748 KB |
Output is correct |
| 5 |
Correct |
2 ms |
6748 KB |
Output is correct |
| 6 |
Correct |
2 ms |
6808 KB |
Output is correct |
| 7 |
Correct |
2 ms |
6748 KB |
Output is correct |
| 8 |
Correct |
164 ms |
89420 KB |
Output is correct |
| 9 |
Correct |
171 ms |
82772 KB |
Output is correct |
| 10 |
Correct |
2 ms |
6744 KB |
Output is correct |
| 11 |
Correct |
61 ms |
53584 KB |
Output is correct |
| 12 |
Correct |
256 ms |
94428 KB |
Output is correct |
| 13 |
Correct |
178 ms |
90228 KB |
Output is correct |
| 14 |
Correct |
110 ms |
88916 KB |
Output is correct |
| 15 |
Correct |
98 ms |
87932 KB |
Output is correct |
