oj.uz

답안 #1075159

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1075159 2024-08-25T19:10:39 Z bleahbleah Tortoise (CEOI21_tortoise) C++17
18 / 100
 2 ms 2396 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

//#ifndef DLOCAL
//   #define cin fin
//   #define cout fout
//   ifstream cin(".in");
//   ofstream cout(".out");
//#endif

using ll = long long;
using ld = long double;

//#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

const int nmax = 5e5 + 5;

int Ld[nmax], Rd[nmax];
int Lp[nmax], Rp[nmax];
int v[nmax];

bool possible(multiset<int> s) {
   int last = -1, timer = 0;
   for(auto x : s) {
      if(last == -1) {
         timer += x - 1;
      }
      else {
         if(Ld[last] != Ld[x] || Rd[last] != Rd[x])
            timer += x - last;
         else timer += min(last - Ld[last] + x - Ld[x], Rd[last] - last + Rd[x] - x);
      }
      if(timer > 2 * (x - 1)) { return 0; }
      last = x;
      //cerr << timer << '\n';
   }
   //cerr << '\n';
   //for(auto x: s) cerr << x << ' '; cerr << '\n';
   //cerr << "ok\n";
   return 1;
}

signed main() {
   cin.tie(0) -> sync_with_stdio(0);
   int n;
   cin >> n;
   
   ll cost = 0;
   for(int i = 1; i <= n; i++)
      cin >> v[i], cost += (v[i] != -1? v[i] : 0);
   for(int lst = -1e9 - 5, i = 1; i <= n; i++) {
      if(v[i] == -1) lst = i;
      else Ld[i] = lst;
   }
   for(int lst = 1e9 + 5, i = n; i > 0; i--) {
      if(v[i] == -1) lst = i;
      else Rd[i] = lst;
   }
   
   vector<vector<pii>> idxs(n + 1);
   multiset<int> sofar;
   
   auto add___ = [&](int l, int r) {
      //cerr << l << ' ' << r << '\n';
      vector<pii> bydist;
      for(int i = l; i <= r; i++) {
         if(v[i] > 0) bydist.emplace_back(min(i - Ld[i], Rd[i] - i), i);
      }
      sort(all(bydist));
      
      int last = 0;
      for(auto [D, p] : bydist) {
         idxs[last].emplace_back(p, 1);
         idxs[D].emplace_back(p, v[p] - 1);
         last = D;
      }
      return;
   };
   for(int i = 1; i <= n; i++) {
      if(v[i] == -1) continue;
      add___(max(0, Ld[i]) + 1, min(n + 1, Rd[i]) - 1);
      i = Rd[i];
   }
   
   //cerr << cost << '\n';
   //for(int i = 0; i < 10; i++) {
      for(auto &T : idxs) {
         for(auto &[x, c] : T) {
            while(c > 0) {
               sofar.emplace(x);
               if(possible(sofar)) c--, cost--;
               else {
                  sofar.erase(sofar.find(x));
                  break;
               }
            }
         }
      }
   //}
   
   cout << cost << '\n';

}

/**
      Töte es durch genaue Untersuchung\Töte es kann es nur noch schlimmer machen\Es lässt es irgendwie atmen
--
*/

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Correct 0 ms 360 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 0 ms 352 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 464 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 352 KB Output is correct
26 Correct 0 ms 472 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Correct 0 ms 360 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 0 ms 352 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 464 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 352 KB Output is correct
26 Correct 0 ms 472 KB Output is correct
27 Correct 1 ms 352 KB Output is correct
28 Correct 0 ms 352 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 352 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 356 KB Output is correct
36 Correct 1 ms 2392 KB Output is correct
37 Correct 0 ms 352 KB Output is correct
38 Correct 0 ms 352 KB Output is correct
39 Correct 0 ms 352 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 356 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Correct 0 ms 360 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 0 ms 352 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 464 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 352 KB Output is correct
26 Correct 0 ms 472 KB Output is correct
27 Correct 1 ms 352 KB Output is correct
28 Correct 0 ms 352 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 352 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 356 KB Output is correct
36 Correct 1 ms 2392 KB Output is correct
37 Correct 0 ms 352 KB Output is correct
38 Correct 0 ms 352 KB Output is correct
39 Correct 0 ms 352 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 356 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 352 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 2 ms 508 KB Output is correct
51 Correct 2 ms 356 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 2 ms 356 KB Output is correct
54 Correct 2 ms 352 KB Output is correct
55 Correct 2 ms 472 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 2 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Incorrect 1 ms 348 KB Output isn't correct
63 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Correct 0 ms 360 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 0 ms 352 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 464 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 352 KB Output is correct
26 Correct 0 ms 472 KB Output is correct
27 Correct 1 ms 352 KB Output is correct
28 Correct 0 ms 352 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 352 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 356 KB Output is correct
36 Correct 1 ms 2392 KB Output is correct
37 Correct 0 ms 352 KB Output is correct
38 Correct 0 ms 352 KB Output is correct
39 Correct 0 ms 352 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 356 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 352 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 2 ms 508 KB Output is correct
51 Correct 2 ms 356 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 2 ms 356 KB Output is correct
54 Correct 2 ms 352 KB Output is correct
55 Correct 2 ms 472 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 2 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Incorrect 1 ms 348 KB Output isn't correct
63 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Correct 0 ms 360 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 0 ms 352 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 464 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 352 KB Output is correct
26 Correct 0 ms 472 KB Output is correct
27 Correct 1 ms 352 KB Output is correct
28 Correct 0 ms 352 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 352 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 356 KB Output is correct
36 Correct 1 ms 2392 KB Output is correct
37 Correct 0 ms 352 KB Output is correct
38 Correct 0 ms 352 KB Output is correct
39 Correct 0 ms 352 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 356 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 352 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 2 ms 508 KB Output is correct
51 Correct 2 ms 356 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 2 ms 356 KB Output is correct
54 Correct 2 ms 352 KB Output is correct
55 Correct 2 ms 472 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 2 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Incorrect 1 ms 348 KB Output isn't correct
63 Halted 0 ms 0 KB -