oj.uz

Submission #835090

# Submission time Handle Problem Language Result Execution time Memory
835090 2023-08-23T08:03:34 Z veehj Cat Exercise (JOI23_ho_t4) C++17
21 / 100
 2000 ms 5172 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define all(x) (x).begin(), (x).end()
int n; vector<pair<int, int>> p;

int f(ll l, ll r, ll nw){
  if(r<=l) return abs(nw-r);
  int ans=0;
  int ht;
  for(int i=0; i<n; i++){
    if(l<=p[i].S && p[i].S<=r){
      ht=p[i].S;
      ans+=abs(nw-ht);
      break;
    }
  }
  return ans+max(f(l, ht-1, ht), f(ht+1, r, ht));
}

int main() {
    cin >> n;
    p.resize(n); 
    for(int i=0; i<n; i++){
      cin >> p[i].F;
      p[i].S=i;
    }
    sort(all(p), greater<pair<int, int>>());
    int a, b; for(int i=0; i<n-1; i++) cin >> a >> b;
    cout << f(0, n-1, p[0].S);
}

Compilation message

Main.cpp: In function 'int f(ll, ll, ll)':
Main.cpp:24:35: warning: 'ht' may be used uninitialized in this function [-Wmaybe-uninitialized]
   24 |   return ans+max(f(l, ht-1, ht), f(ht+1, r, ht));
      |                                  ~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 13 ms 532 KB Output is correct
19 Correct 19 ms 664 KB Output is correct
20 Correct 19 ms 588 KB Output is correct
21 Correct 13 ms 340 KB Output is correct
22 Correct 12 ms 404 KB Output is correct
23 Correct 13 ms 404 KB Output is correct
24 Correct 12 ms 404 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 13 ms 532 KB Output is correct
19 Correct 19 ms 664 KB Output is correct
20 Correct 19 ms 588 KB Output is correct
21 Correct 13 ms 340 KB Output is correct
22 Correct 12 ms 404 KB Output is correct
23 Correct 13 ms 404 KB Output is correct
24 Correct 12 ms 404 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Incorrect 12 ms 312 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 13 ms 532 KB Output is correct
19 Correct 19 ms 664 KB Output is correct
20 Correct 19 ms 588 KB Output is correct
21 Correct 13 ms 340 KB Output is correct
22 Correct 12 ms 404 KB Output is correct
23 Correct 13 ms 404 KB Output is correct
24 Correct 12 ms 404 KB Output is correct
25 Execution timed out 2060 ms 5172 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

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

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 13 ms 532 KB Output is correct
19 Correct 19 ms 664 KB Output is correct
20 Correct 19 ms 588 KB Output is correct
21 Correct 13 ms 340 KB Output is correct
22 Correct 12 ms 404 KB Output is correct
23 Correct 13 ms 404 KB Output is correct
24 Correct 12 ms 404 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Incorrect 12 ms 312 KB Output isn't correct
27 Halted 0 ms 0 KB -