oj.uz

Submission #1069241

# Submission time Handle Problem Language Result Execution time Memory
1069241 2024-08-21T18:00:31 Z raduv Fountain (eJOI20_fountain) C++14
100 / 100
 138 ms 21076 KB 
#include <bits/stdc++.h>
#define pi pair<int, int>
const int MAXN = 100'000;
const int LOG = 18;
using namespace std;
int rmq[LOG + 1][MAXN + 1];
int cap[LOG + 1][MAXN + 1];
pi stiva[MAXN + 1];
int ns;
priority_queue<pi, vector<pi>, greater<pi>> pq;
int main()
{
    int n, q, i, diam, p, a, b;
    scanf("%d%d", &n, &q);
    for( i = 1; i <= n + 1; i++ ){
      if( i <= n )
        scanf("%d%d", &diam, &cap[0][i]);
      else
        diam = 1e9;
      while(ns > 0 && diam > stiva[ns].first){
        rmq[0][stiva[ns].second] = i;
        ns--;
      }
      stiva[++ns] = {diam, i};
    }
    //  https://infoarena.ro/problema/stramosi
    for ( p = 1; p <= LOG; p++ ){
      for( i = 1; i <= n; i++ ){
        rmq[p][i] = rmq[p - 1][rmq[p - 1][i]];
        cap[p][i] = cap[p - 1][i] + cap[p - 1][rmq[p - 1][i]];
      }
    }
    while(q--){
      scanf("%d%d", &a, &b);
      for( i = LOG; i >= 0; i-- ){
        if(cap[i][a] < b){
          b -= cap[i][a];
          a = rmq[i][a];
        }
      }
      printf("%d\n", a);
    }
    return 0;
}

Compilation message

fountain.cpp: In function 'int main()':
fountain.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     scanf("%d%d", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~
fountain.cpp:17:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         scanf("%d%d", &diam, &cap[0][i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
fountain.cpp:34:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |       scanf("%d%d", &a, &b);
      |       ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2772 KB Output is correct
4 Correct 1 ms 2904 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 8796 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 19028 KB Output is correct
2 Correct 96 ms 19168 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2772 KB Output is correct
4 Correct 1 ms 2904 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 8796 KB Output is correct
8 Correct 82 ms 19028 KB Output is correct
9 Correct 96 ms 19168 KB Output is correct
10 Correct 2 ms 8840 KB Output is correct
11 Correct 52 ms 14928 KB Output is correct
12 Correct 138 ms 21076 KB Output is correct
13 Correct 111 ms 20736 KB Output is correct
14 Correct 66 ms 19944 KB Output is correct
15 Correct 65 ms 20440 KB Output is correct