oj.uz

Submission #1069246

# Submission time Handle Problem Language Result Execution time Memory
1069246 2024-08-21T18:04:57 Z raduv Fountain (eJOI20_fountain) C++14
100 / 100
 127 ms 17212 KB 
#include <stdio.h>
#include <utility>
#pragma GCC optimize("O3", "Ofast", "unroll-loops")
#pragma GCC target ("avx2")
const int MAXN = 100'000;
const int LOG = 18;
using namespace std;
int rmq[LOG + 1][MAXN + 1], cap[LOG + 1][MAXN + 1];
pair<int, int> stiva[MAXN + 1];
int ns;
int main()
{
    int n, q, i, diam, p, a, b;
    scanf("%d%d", &n, &q);
    for( i = 1; i <= n; i++ ){
      scanf("%d%d", &diam, &cap[0][i]);
      while(ns > 0 && diam > stiva[ns].first)
        rmq[0][stiva[ns--].second] = i;
      stiva[++ns] = {diam, i};
    }
    while(ns > 0)
      rmq[0][stiva[ns--].second] = i;
    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:16:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |       scanf("%d%d", &diam, &cap[0][i]);
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
fountain.cpp:30:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |       scanf("%d%d", &a, &b);
      |       ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 15280 KB Output is correct
2 Correct 99 ms 14416 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 8536 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 89 ms 15280 KB Output is correct
9 Correct 99 ms 14416 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 49 ms 10296 KB Output is correct
12 Correct 127 ms 16464 KB Output is correct
13 Correct 106 ms 16416 KB Output is correct
14 Correct 67 ms 16208 KB Output is correct
15 Correct 57 ms 17212 KB Output is correct