oj.uz

Submission #165268

# Submission time Handle Problem Language Result Execution time Memory
165268 2019-11-26T10:14:00 Z Bojack Triple Jump (JOI19_jumps) C++14
27 / 100
 84 ms 7144 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

void solve() {
  int n; scanf("%d", &n);
  vector <int> a(n);
  for(int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  int q; scanf("%d", &q);
  while(q--) {
    int l, r; scanf("%d", &l, &r);
  }
  stack <int> s;
  vector <pair <int, int>> can;
  for(int i = n - 1; i >= 0; i--) {
    while(!s.empty() and a[s.top()] < a[i]) {
      can.push_back({s.top(), i});
      s.pop();
    }
    if(!s.empty()) {
      can.push_back({i, s.top()});
    }
    s.push(i);
  }
  vector <int> mx(n);
  mx[n - 1] = a[n - 1];
  for(int i = n - 2; i >= 0; i--) {
    mx[i] = max(mx[i + 1], a[i]);
  }
  int ans = 0;
  for(auto p : can) {
    int i = p.first;
    int j = p.second;
    if(i > j) swap(i, j);
    if(j + j - i < n) ans = max(ans, a[i] + a[j] + mx[j + j - i]);
  }
  printf("%d\n", ans);
}

int main() {
  solve();
}

Compilation message

jumps.cpp: In function 'void solve()':
jumps.cpp:15:33: warning: too many arguments for format [-Wformat-extra-args]
     int l, r; scanf("%d", &l, &r);
                                 ^
jumps.cpp:8:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int n; scanf("%d", &n);
          ~~~~~^~~~~~~~~~
jumps.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &a[i]);
     ~~~~~^~~~~~~~~~~~~
jumps.cpp:13:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int q; scanf("%d", &q);
          ~~~~~^~~~~~~~~~
jumps.cpp:15:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     int l, r; scanf("%d", &l, &r);
               ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 7144 KB Output is correct
2 Correct 42 ms 5864 KB Output is correct
3 Correct 39 ms 3772 KB Output is correct
4 Correct 52 ms 6220 KB Output is correct
5 Correct 51 ms 5992 KB Output is correct
6 Correct 44 ms 6504 KB Output is correct
7 Correct 42 ms 5864 KB Output is correct
8 Correct 84 ms 6408 KB Output is correct
9 Correct 46 ms 6632 KB Output is correct

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -