oj.uz

Submission #1073226

# Submission time Handle Problem Language Result Execution time Memory
1073226 2024-08-24T10:41:38 Z vjudge1 Tricks of the Trade (CEOI23_trade) C++17
30 / 100
 1845 ms 2097152 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

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 = 25e4 + 5;

int K;

template<typename T>
struct Deq {
   vector<T> v;
   void push_front(T x) { v.emplace_back(x); }
   T& operator[](const int& x) { return rbegin(v)[x]; }
   void resize(int k) {
      if(k >= sz(v)) return;
      v.erase(begin(v), begin(v) + sz(v) - k);
      return;
   }
   int size() { return sz(v); }
}; // trebuie facut persistent

struct Tree {
   vector<int> g[nmax];
   int p[nmax];
   void add_edge(int a, int b) {
      g[a].emplace_back(b);
      p[b] = a;
   }
   
   struct mdeq : Deq<ll> {
      ll lazy = 0;
   };
   
   mdeq dp[nmax];
   vector<bool> merge[nmax];
   int calculated[nmax];
   Tree(int n) {
      memset(calculated, 0, sizeof(calculated));
   }
   template<class CB, class CB2> void calcdp(CB&& cost, CB2 atr, int node) {
      if(calculated[node]) return;
      calculated[node] = 1;
      
      
      for(auto x : g[node]) {
         calcdp(cost, atr, x);
         bool swapped = 0;
         
         auto T = dp[x];
         T.resize(K + 1);
         
         if(sz(T) > sz(dp[node]))
            swap(T, dp[node]);
            
         for(int i = 0; i < sz(T); i++)
            dp[node][i] = max(T[i] + T.lazy - dp[node].lazy, dp[node][i]);
      }
      dp[node].push_front(cost(node) - dp[node].lazy);
      dp[node].lazy += atr(node);
      merge[node].assign(sz(dp[node]), 0);
      return;
   }
   template<class CB> void propmerge(CB&& atr, vector<int> order) {
      for(auto node : order) {
         for(auto x : g[node]) {
            auto T = dp[x];
            for(int i = 0; i < sz(T) && i + 1 < sz(dp[node]); i++) {
               if(T[i] + T.lazy - dp[node].lazy + atr(node) == dp[node][i + 1])
                  merge[x][i] = merge[x][i] || merge[node][i + 1];
            }
         }
      }
      return;
   }
};

ll spart[nmax];

signed main() {
   cin.tie(0) -> sync_with_stdio(0);
   int n;
   cin >> n >> K;
   
   for(int i = 1, x; i <= n; i++) {
      cin >> spart[i];
      spart[i] += spart[i - 1];
   }
   
   vector<int> v(n + 1);
   for(int i = 1; i <= n; i++) cin >> v[i];
   Tree toleft(n), toright(n);
   
   vector<int> st;
   
   for(int i = 1; i <= n; i++) {
      while(sz(st) && v[st.back()] <= v[i]) st.pop_back();
      if(sz(st) == 0) toleft.add_edge(0, i);
      else toleft.add_edge(st.back(), i), toright.add_edge(i, st.back());
      st.emplace_back(i);
   }
   st.clear();
   
   for(int i = n; i > 0; i--) {
      while(sz(st) && v[st.back()] < v[i]) st.pop_back();
      if(sz(st) == 0) toright.add_edge(0, i);
      else toright.add_edge(st.back(), i), toleft.add_edge(i, st.back());
      st.emplace_back(i);
   }
   st.clear();
   
   toleft.calcdp([&](int x) { return x == 0? 0 : -spart[x]; }, [&](int x) { return v[x]; }, 0);
   toright.calcdp([&](int x) { return x == 0? 0 : spart[x - 1]; }, [&](int x) { return v[x]; }, 0);

   ll best_cost = -1e18;

   for(int P = 1; P <= n; P++) {
      auto& X = toleft.dp[P];
      auto& Y = toright.dp[P];
      bool swapped = 0;
      if(sz(X) > sz(Y)) swapped = 1, swap(X, Y);
      
      for(int i = 0; i < min(K, sz(X)); i++) {
         int j = K - i - 1;
         if(j >= sz(Y)) continue;
         
         best_cost = max(best_cost, X[i] + Y[j] + X.lazy + Y.lazy - v[P]);
      } 
      if(swapped) swap(X, Y);
   }
   
   for(int P = 1; P <= n; P++) {
      auto& X = toleft.dp[P];
      auto& Y = toright.dp[P];
      bool swapped = 0;
      if(sz(X) > sz(Y)) swapped = 1, swap(X, Y);
      
      
      for(int i = 0; i < min(K, sz(X)); i++) {
         int j = K - i - 1;
         if(j >= sz(Y)) continue;
         
         if(best_cost == X[i] + Y[j] + X.lazy + Y.lazy - v[P]) {
            if(!swapped)
               toleft.merge[P][i] = 1, toright.merge[P][j] = 1;
            else
               toright.merge[P][i] = 1, toleft.merge[P][j] = 1;
         }  
      }
      if(swapped) swap(X, Y);
   }
   
   vector<int> order(n);
   iota(all(order), 1);
   toleft.propmerge([&](int x) { return v[x]; }, order);
   
   reverse(all(order));
   toright.propmerge([&](int x) { return v[x]; }, order);
   
   cout << best_cost << '\n';
   for(int i = 1; i <= n; i++) {
      bool ok = 0;
      for(auto x : toleft.merge[i]) {
         if(ok) break;
         if(x) { ok = 1; break; }
      }
      for(auto x : toright.merge[i]) {
         if(ok) break;
         if(x) { ok = 1; break; }
      }
      cout << ok;
   }
   cout << '\n';
}


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

Compilation message

trade.cpp: In function 'int main()':
trade.cpp:93:19: warning: unused variable 'x' [-Wunused-variable]
   93 |    for(int i = 1, x; i <= n; i++) {
      |                   ^
trade.cpp: In instantiation of 'void Tree::calcdp(CB&&, CB2, int) [with CB = main()::<lambda(int)>; CB2 = main()::<lambda(int)>]':
trade.cpp:120:94:   required from here
trade.cpp:56:15: warning: unused variable 'swapped' [-Wunused-variable]
   56 |          bool swapped = 0;
      |               ^~~~~~~
trade.cpp: In instantiation of 'void Tree::calcdp(CB&&, CB2, int) [with CB = main()::<lambda(int)>; CB2 = main()::<lambda(int)>]':
trade.cpp:121:98:   required from here
trade.cpp:56:15: warning: unused variable 'swapped' [-Wunused-variable]
trade.cpp: In instantiation of 'void Tree::calcdp(CB&&, CB2, int) [with CB = main()::<lambda(int)>&; CB2 = main()::<lambda(int)>]':
trade.cpp:55:16:   required from 'void Tree::calcdp(CB&&, CB2, int) [with CB = main()::<lambda(int)>; CB2 = main()::<lambda(int)>]'
trade.cpp:120:94:   required from here
trade.cpp:56:15: warning: unused variable 'swapped' [-Wunused-variable]
trade.cpp: In instantiation of 'void Tree::calcdp(CB&&, CB2, int) [with CB = main()::<lambda(int)>&; CB2 = main()::<lambda(int)>]':
trade.cpp:55:16:   required from 'void Tree::calcdp(CB&&, CB2, int) [with CB = main()::<lambda(int)>; CB2 = main()::<lambda(int)>]'
trade.cpp:121:98:   required from here
trade.cpp:56:15: warning: unused variable 'swapped' [-Wunused-variable]

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 51288 KB Output is correct
2 Correct 32 ms 51200 KB Output is correct

Subtask #1
5.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 51292 KB Output is correct
2 Correct 34 ms 51288 KB Output is correct
3 Correct 29 ms 51292 KB Output is correct
4 Correct 32 ms 51540 KB Output is correct
5 Correct 34 ms 52052 KB Output is correct
6 Correct 35 ms 51288 KB Output is correct
7 Correct 33 ms 51540 KB Output is correct
8 Correct 31 ms 51536 KB Output is correct
9 Partially correct 34 ms 51548 KB Partially correct
10 Correct 32 ms 51448 KB Output is correct
11 Partially correct 30 ms 51276 KB Partially correct

Subtask #2
5.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 51292 KB Output is correct
2 Correct 34 ms 51288 KB Output is correct
3 Correct 29 ms 51292 KB Output is correct
4 Correct 32 ms 51540 KB Output is correct
5 Correct 34 ms 52052 KB Output is correct
6 Correct 35 ms 51288 KB Output is correct
7 Correct 33 ms 51540 KB Output is correct
8 Correct 31 ms 51536 KB Output is correct
9 Partially correct 34 ms 51548 KB Partially correct
10 Correct 32 ms 51448 KB Output is correct
11 Partially correct 30 ms 51276 KB Partially correct
12 Correct 33 ms 51112 KB Output is correct
13 Correct 31 ms 51284 KB Output is correct
14 Correct 31 ms 51288 KB Output is correct
15 Correct 32 ms 51548 KB Output is correct
16 Correct 34 ms 51932 KB Output is correct
17 Correct 30 ms 51272 KB Output is correct
18 Correct 32 ms 51544 KB Output is correct
19 Correct 34 ms 51536 KB Output is correct
20 Partially correct 30 ms 51544 KB Partially correct
21 Correct 33 ms 51284 KB Output is correct
22 Partially correct 30 ms 51280 KB Partially correct
23 Correct 443 ms 418336 KB Output is correct
24 Correct 34 ms 53844 KB Output is correct
25 Correct 161 ms 147024 KB Output is correct
26 Correct 51 ms 63020 KB Output is correct
27 Correct 330 ms 279380 KB Output is correct
28 Correct 38 ms 53848 KB Output is correct
29 Correct 387 ms 296340 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 51288 KB Output is correct
2 Correct 218 ms 155128 KB Output is correct
3 Correct 268 ms 155376 KB Output is correct
4 Correct 294 ms 156284 KB Output is correct
5 Correct 235 ms 155512 KB Output is correct
6 Correct 234 ms 156028 KB Output is correct
7 Correct 237 ms 155420 KB Output is correct
8 Correct 262 ms 155004 KB Output is correct
9 Correct 249 ms 154628 KB Output is correct
10 Correct 225 ms 155060 KB Output is correct

Subtask #4
10.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 51288 KB Output is correct
2 Correct 218 ms 155128 KB Output is correct
3 Correct 268 ms 155376 KB Output is correct
4 Correct 294 ms 156284 KB Output is correct
5 Correct 235 ms 155512 KB Output is correct
6 Correct 234 ms 156028 KB Output is correct
7 Correct 237 ms 155420 KB Output is correct
8 Correct 262 ms 155004 KB Output is correct
9 Correct 249 ms 154628 KB Output is correct
10 Correct 225 ms 155060 KB Output is correct
11 Correct 43 ms 51120 KB Output is correct
12 Correct 207 ms 155128 KB Output is correct
13 Correct 255 ms 155260 KB Output is correct
14 Correct 226 ms 156108 KB Output is correct
15 Correct 252 ms 155612 KB Output is correct
16 Correct 225 ms 156072 KB Output is correct
17 Correct 262 ms 155564 KB Output is correct
18 Correct 268 ms 155008 KB Output is correct
19 Correct 251 ms 154812 KB Output is correct
20 Correct 234 ms 155000 KB Output is correct
21 Correct 33 ms 51292 KB Output is correct
22 Correct 34 ms 51292 KB Output is correct
23 Correct 32 ms 51496 KB Output is correct
24 Correct 33 ms 51928 KB Output is correct
25 Correct 30 ms 51292 KB Output is correct
26 Correct 35 ms 51548 KB Output is correct
27 Correct 35 ms 51540 KB Output is correct
28 Partially correct 34 ms 51548 KB Partially correct
29 Correct 34 ms 51548 KB Output is correct
30 Partially correct 36 ms 51284 KB Partially correct
31 Correct 1845 ms 932872 KB Output is correct
32 Correct 237 ms 158224 KB Output is correct
33 Correct 1633 ms 940156 KB Output is correct
34 Correct 1590 ms 939980 KB Output is correct
35 Partially correct 1543 ms 939792 KB Partially correct
36 Partially correct 1608 ms 939024 KB Partially correct
37 Correct 1580 ms 939520 KB Output is correct

Subtask #5
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 51288 KB Output is correct
2 Correct 32 ms 51200 KB Output is correct
3 Correct 33 ms 51292 KB Output is correct
4 Correct 34 ms 51288 KB Output is correct
5 Correct 29 ms 51292 KB Output is correct
6 Correct 32 ms 51540 KB Output is correct
7 Correct 34 ms 52052 KB Output is correct
8 Correct 35 ms 51288 KB Output is correct
9 Correct 33 ms 51540 KB Output is correct
10 Correct 31 ms 51536 KB Output is correct
11 Partially correct 34 ms 51548 KB Partially correct
12 Correct 32 ms 51448 KB Output is correct
13 Partially correct 30 ms 51276 KB Partially correct
14 Correct 33 ms 51112 KB Output is correct
15 Correct 31 ms 51284 KB Output is correct
16 Correct 31 ms 51288 KB Output is correct
17 Correct 32 ms 51548 KB Output is correct
18 Correct 34 ms 51932 KB Output is correct
19 Correct 30 ms 51272 KB Output is correct
20 Correct 32 ms 51544 KB Output is correct
21 Correct 34 ms 51536 KB Output is correct
22 Partially correct 30 ms 51544 KB Partially correct
23 Correct 33 ms 51284 KB Output is correct
24 Partially correct 30 ms 51280 KB Partially correct
25 Correct 443 ms 418336 KB Output is correct
26 Correct 34 ms 53844 KB Output is correct
27 Correct 161 ms 147024 KB Output is correct
28 Correct 51 ms 63020 KB Output is correct
29 Correct 330 ms 279380 KB Output is correct
30 Correct 38 ms 53848 KB Output is correct
31 Correct 387 ms 296340 KB Output is correct
32 Correct 31 ms 51288 KB Output is correct
33 Correct 218 ms 155128 KB Output is correct
34 Correct 268 ms 155376 KB Output is correct
35 Correct 294 ms 156284 KB Output is correct
36 Correct 235 ms 155512 KB Output is correct
37 Correct 234 ms 156028 KB Output is correct
38 Correct 237 ms 155420 KB Output is correct
39 Correct 262 ms 155004 KB Output is correct
40 Correct 249 ms 154628 KB Output is correct
41 Correct 225 ms 155060 KB Output is correct
42 Correct 43 ms 51120 KB Output is correct
43 Correct 207 ms 155128 KB Output is correct
44 Correct 255 ms 155260 KB Output is correct
45 Correct 226 ms 156108 KB Output is correct
46 Correct 252 ms 155612 KB Output is correct
47 Correct 225 ms 156072 KB Output is correct
48 Correct 262 ms 155564 KB Output is correct
49 Correct 268 ms 155008 KB Output is correct
50 Correct 251 ms 154812 KB Output is correct
51 Correct 234 ms 155000 KB Output is correct
52 Correct 33 ms 51292 KB Output is correct
53 Correct 34 ms 51292 KB Output is correct
54 Correct 32 ms 51496 KB Output is correct
55 Correct 33 ms 51928 KB Output is correct
56 Correct 30 ms 51292 KB Output is correct
57 Correct 35 ms 51548 KB Output is correct
58 Correct 35 ms 51540 KB Output is correct
59 Partially correct 34 ms 51548 KB Partially correct
60 Correct 34 ms 51548 KB Output is correct
61 Partially correct 36 ms 51284 KB Partially correct
62 Correct 1845 ms 932872 KB Output is correct
63 Correct 237 ms 158224 KB Output is correct
64 Correct 1633 ms 940156 KB Output is correct
65 Correct 1590 ms 939980 KB Output is correct
66 Partially correct 1543 ms 939792 KB Partially correct
67 Partially correct 1608 ms 939024 KB Partially correct
68 Correct 1580 ms 939520 KB Output is correct
69 Correct 33 ms 51288 KB Output is correct
70 Correct 224 ms 156140 KB Output is correct
71 Correct 251 ms 157968 KB Output is correct
72 Correct 220 ms 158844 KB Output is correct
73 Correct 219 ms 158356 KB Output is correct
74 Correct 237 ms 158332 KB Output is correct
75 Correct 241 ms 157304 KB Output is correct
76 Correct 260 ms 157816 KB Output is correct
77 Correct 240 ms 156164 KB Output is correct
78 Correct 209 ms 156920 KB Output is correct
79 Correct 29 ms 51284 KB Output is correct
80 Correct 30 ms 51288 KB Output is correct
81 Correct 30 ms 51548 KB Output is correct
82 Correct 32 ms 52060 KB Output is correct
83 Correct 33 ms 51292 KB Output is correct
84 Correct 33 ms 51384 KB Output is correct
85 Correct 30 ms 51548 KB Output is correct
86 Partially correct 30 ms 51548 KB Partially correct
87 Correct 35 ms 51280 KB Output is correct
88 Partially correct 33 ms 51380 KB Partially correct
89 Correct 1451 ms 932984 KB Output is correct
90 Correct 226 ms 158360 KB Output is correct
91 Correct 1530 ms 940084 KB Output is correct
92 Correct 1509 ms 940060 KB Output is correct
93 Partially correct 1538 ms 939776 KB Partially correct
94 Partially correct 1544 ms 938880 KB Partially correct
95 Correct 1431 ms 939524 KB Output is correct
96 Correct 453 ms 418388 KB Output is correct
97 Correct 33 ms 53852 KB Output is correct
98 Correct 174 ms 147028 KB Output is correct
99 Correct 60 ms 63112 KB Output is correct
100 Correct 352 ms 279380 KB Output is correct
101 Correct 35 ms 53724 KB Output is correct
102 Correct 358 ms 296276 KB Output is correct
103 Runtime error 1457 ms 2097152 KB Execution killed with signal 9
104 Halted 0 ms 0 KB -