oj.uz

Submission #1114136

# Submission time Handle Problem Language Result Execution time Memory
1114136 2024-11-18T08:39:46 Z SalihSahin Netrpeljivost (COI23_netrpeljivost) C++14
59 / 100
 1500 ms 56752 KB 
#include <bits/stdc++.h>
#define pb push_back
#define int long long
using namespace std;
 
const int inf = 1e15 + 10;
const int N = 2048 + 10;
 
vector<vector<int> > c(N, vector<int>(N));
vector<vector<int> > dp[N];

int ans;
 
void f(int node, int l, int r){
   if(r - l == 1){
      dp[node].resize(2);
      dp[node][0].resize(2);
      dp[node][1].resize(2);

      dp[node][0][1] = dp[node][1][0] = c[l][r];
      dp[node][0][0] = dp[node][1][1] = inf;
      return;
   }
 
   int m = (l + r)/2;
   f(node * 2, l, m);
   f(node * 2 + 1, m+1, r);
   int sz = (r - l + 1)/2;

   if(node == 1){
      vector<int> ldp(sz, inf), rdp(sz, inf);
      for(int i = 0; i < sz; i++){
         for(int j = 0; j < sz; j++){
            ldp[j] = min(ldp[j], dp[node*2][i][j]);
         }
      }
      for(int i = 0; i < sz; i++){
         for(int j = 0; j < sz; j++){
            rdp[i] = min(rdp[i], dp[node*2+1][i][j]);
         }
      }

      ans = inf;
      for(int i = 0; i < sz; i++){
         for(int j = 0; j < sz; j++){
            ans = min(ans, ldp[j] + c[j + l][i + l + sz] + rdp[i]);
         }
      }
      return;
   }
 
   dp[node].resize(sz*2);
   for(int i = 0; i < sz*2; i++){
      dp[node][i].resize(sz*2);
   }
 
   for(int i = 0; i < sz*2; i++){
      for(int j = 0; j < sz*2; j++){
         dp[node][i][j] = inf;
      }
   }

   vector<vector<int> > dp2(sz, vector<int>(sz, inf));
   for(int l1 = 0; l1 < sz; l1++){
      for(int r1 = 0; r1 < sz; r1++){
         for(int l2 = 0; l2 < sz; l2++){
            dp2[l1][l2] = min(dp2[l1][l2], dp[node*2][l1][r1] + c[r1 + l][l2 + l + sz]); 
         }
      }
   }

   for(int l1 = 0; l1 < sz; l1++){
      for(int r2 = 0; r2 < sz; r2++){
         for(int l2 = 0; l2 < sz; l2++){
            dp[node][l1][r2 + sz] = min(dp[node][l1][r2 + sz], dp2[l1][l2] + dp[node*2+1][l2][r2]);
         }
      }
   }

   for(int i = 0; i < sz; i++){
      for(int j = 0; j < sz; j++){
         dp2[i][j] = inf;
      }
   }

   for(int l2 = 0; l2 < sz; l2++){
      for(int r2 = 0; r2 < sz; r2++){
         for(int l1 = 0; l1 < sz; l1++){
            dp2[l2][l1] = min(dp2[l2][l1], dp[node*2 + 1][l2][r2] + c[r2 + l + sz][l1 + l]); 
         }
      }
   }

   for(int l2 = 0; l2 < sz; l2++){
      for(int r1 = 0; r1 < sz; r1++){
         for(int l1 = 0; l1 < sz; l1++){
            dp[node][l2 + sz][r1] = min(dp[node][l2 + sz][r1], dp2[l2][l1] + dp[node*2][l1][r1]);
         }
      }
   }

   dp[node*2].clear();
   dp[node*2+1].clear();
}
 
int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(0); cout.tie(0);
   int n;
   cin>>n;
   for(int i = 0; i < n; i++){
      for(int j = 0; j < n; j++){
         //c[i][j] = 1;
         cin>>c[i][j];
      }
   }

   if(n == 1){
      cout<<0<<endl;
      return 0;
   }
   f(1, 0, n-1);
   cout<<ans<<endl;
   return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 33616 KB Output is correct
2 Correct 28 ms 33628 KB Output is correct
3 Correct 26 ms 33780 KB Output is correct
4 Correct 24 ms 33616 KB Output is correct
5 Correct 23 ms 33608 KB Output is correct
6 Correct 23 ms 33616 KB Output is correct
7 Correct 23 ms 33608 KB Output is correct
8 Correct 25 ms 33616 KB Output is correct
9 Correct 25 ms 33616 KB Output is correct
10 Correct 23 ms 33680 KB Output is correct
11 Correct 25 ms 33700 KB Output is correct
12 Correct 23 ms 33616 KB Output is correct
13 Correct 25 ms 33528 KB Output is correct
14 Correct 29 ms 33616 KB Output is correct
15 Correct 24 ms 33616 KB Output is correct
16 Correct 24 ms 33728 KB Output is correct
17 Correct 23 ms 33728 KB Output is correct
18 Correct 22 ms 33520 KB Output is correct
19 Correct 22 ms 33572 KB Output is correct
20 Correct 22 ms 33616 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 33616 KB Output is correct
2 Correct 28 ms 33628 KB Output is correct
3 Correct 26 ms 33780 KB Output is correct
4 Correct 24 ms 33616 KB Output is correct
5 Correct 23 ms 33608 KB Output is correct
6 Correct 23 ms 33616 KB Output is correct
7 Correct 23 ms 33608 KB Output is correct
8 Correct 25 ms 33616 KB Output is correct
9 Correct 25 ms 33616 KB Output is correct
10 Correct 23 ms 33680 KB Output is correct
11 Correct 25 ms 33700 KB Output is correct
12 Correct 23 ms 33616 KB Output is correct
13 Correct 25 ms 33528 KB Output is correct
14 Correct 29 ms 33616 KB Output is correct
15 Correct 24 ms 33616 KB Output is correct
16 Correct 24 ms 33728 KB Output is correct
17 Correct 23 ms 33728 KB Output is correct
18 Correct 22 ms 33520 KB Output is correct
19 Correct 22 ms 33572 KB Output is correct
20 Correct 22 ms 33616 KB Output is correct
21 Correct 26 ms 33696 KB Output is correct
22 Correct 23 ms 33824 KB Output is correct
23 Correct 24 ms 33616 KB Output is correct
24 Correct 23 ms 33616 KB Output is correct
25 Correct 23 ms 33612 KB Output is correct
26 Correct 23 ms 33872 KB Output is correct
27 Correct 29 ms 33884 KB Output is correct
28 Correct 24 ms 33616 KB Output is correct
29 Correct 25 ms 33616 KB Output is correct
30 Correct 24 ms 33872 KB Output is correct
31 Correct 24 ms 33760 KB Output is correct
32 Correct 24 ms 33796 KB Output is correct
33 Correct 24 ms 33616 KB Output is correct
34 Correct 27 ms 33732 KB Output is correct
35 Correct 24 ms 33628 KB Output is correct
36 Correct 24 ms 33616 KB Output is correct
37 Correct 30 ms 33808 KB Output is correct
38 Correct 25 ms 33796 KB Output is correct
39 Correct 23 ms 33608 KB Output is correct
40 Correct 24 ms 33872 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 33616 KB Output is correct
2 Correct 28 ms 33628 KB Output is correct
3 Correct 26 ms 33780 KB Output is correct
4 Correct 24 ms 33616 KB Output is correct
5 Correct 23 ms 33608 KB Output is correct
6 Correct 23 ms 33616 KB Output is correct
7 Correct 23 ms 33608 KB Output is correct
8 Correct 25 ms 33616 KB Output is correct
9 Correct 25 ms 33616 KB Output is correct
10 Correct 23 ms 33680 KB Output is correct
11 Correct 25 ms 33700 KB Output is correct
12 Correct 23 ms 33616 KB Output is correct
13 Correct 25 ms 33528 KB Output is correct
14 Correct 29 ms 33616 KB Output is correct
15 Correct 24 ms 33616 KB Output is correct
16 Correct 24 ms 33728 KB Output is correct
17 Correct 23 ms 33728 KB Output is correct
18 Correct 22 ms 33520 KB Output is correct
19 Correct 22 ms 33572 KB Output is correct
20 Correct 22 ms 33616 KB Output is correct
21 Correct 26 ms 33696 KB Output is correct
22 Correct 23 ms 33824 KB Output is correct
23 Correct 24 ms 33616 KB Output is correct
24 Correct 23 ms 33616 KB Output is correct
25 Correct 23 ms 33612 KB Output is correct
26 Correct 23 ms 33872 KB Output is correct
27 Correct 29 ms 33884 KB Output is correct
28 Correct 24 ms 33616 KB Output is correct
29 Correct 25 ms 33616 KB Output is correct
30 Correct 24 ms 33872 KB Output is correct
31 Correct 24 ms 33760 KB Output is correct
32 Correct 24 ms 33796 KB Output is correct
33 Correct 24 ms 33616 KB Output is correct
34 Correct 27 ms 33732 KB Output is correct
35 Correct 24 ms 33628 KB Output is correct
36 Correct 24 ms 33616 KB Output is correct
37 Correct 30 ms 33808 KB Output is correct
38 Correct 25 ms 33796 KB Output is correct
39 Correct 23 ms 33608 KB Output is correct
40 Correct 24 ms 33872 KB Output is correct
41 Correct 57 ms 35280 KB Output is correct
42 Correct 70 ms 35144 KB Output is correct
43 Correct 61 ms 35144 KB Output is correct
44 Correct 68 ms 35144 KB Output is correct
45 Correct 63 ms 35144 KB Output is correct
46 Correct 60 ms 35144 KB Output is correct
47 Correct 72 ms 35284 KB Output is correct
48 Correct 59 ms 35136 KB Output is correct
49 Correct 61 ms 35152 KB Output is correct
50 Correct 59 ms 35144 KB Output is correct
51 Correct 62 ms 35276 KB Output is correct
52 Correct 63 ms 35104 KB Output is correct
53 Correct 61 ms 35144 KB Output is correct
54 Correct 58 ms 35268 KB Output is correct
55 Correct 57 ms 35052 KB Output is correct
56 Correct 57 ms 35272 KB Output is correct
57 Correct 57 ms 35280 KB Output is correct
58 Correct 63 ms 35164 KB Output is correct
59 Correct 77 ms 35132 KB Output is correct
60 Correct 61 ms 35060 KB Output is correct

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 33616 KB Output is correct
2 Correct 28 ms 33628 KB Output is correct
3 Correct 26 ms 33780 KB Output is correct
4 Correct 24 ms 33616 KB Output is correct
5 Correct 23 ms 33608 KB Output is correct
6 Correct 23 ms 33616 KB Output is correct
7 Correct 23 ms 33608 KB Output is correct
8 Correct 25 ms 33616 KB Output is correct
9 Correct 25 ms 33616 KB Output is correct
10 Correct 23 ms 33680 KB Output is correct
11 Correct 25 ms 33700 KB Output is correct
12 Correct 23 ms 33616 KB Output is correct
13 Correct 25 ms 33528 KB Output is correct
14 Correct 29 ms 33616 KB Output is correct
15 Correct 24 ms 33616 KB Output is correct
16 Correct 24 ms 33728 KB Output is correct
17 Correct 23 ms 33728 KB Output is correct
18 Correct 22 ms 33520 KB Output is correct
19 Correct 22 ms 33572 KB Output is correct
20 Correct 22 ms 33616 KB Output is correct
21 Correct 26 ms 33696 KB Output is correct
22 Correct 23 ms 33824 KB Output is correct
23 Correct 24 ms 33616 KB Output is correct
24 Correct 23 ms 33616 KB Output is correct
25 Correct 23 ms 33612 KB Output is correct
26 Correct 23 ms 33872 KB Output is correct
27 Correct 29 ms 33884 KB Output is correct
28 Correct 24 ms 33616 KB Output is correct
29 Correct 25 ms 33616 KB Output is correct
30 Correct 24 ms 33872 KB Output is correct
31 Correct 24 ms 33760 KB Output is correct
32 Correct 24 ms 33796 KB Output is correct
33 Correct 24 ms 33616 KB Output is correct
34 Correct 27 ms 33732 KB Output is correct
35 Correct 24 ms 33628 KB Output is correct
36 Correct 24 ms 33616 KB Output is correct
37 Correct 30 ms 33808 KB Output is correct
38 Correct 25 ms 33796 KB Output is correct
39 Correct 23 ms 33608 KB Output is correct
40 Correct 24 ms 33872 KB Output is correct
41 Correct 57 ms 35280 KB Output is correct
42 Correct 70 ms 35144 KB Output is correct
43 Correct 61 ms 35144 KB Output is correct
44 Correct 68 ms 35144 KB Output is correct
45 Correct 63 ms 35144 KB Output is correct
46 Correct 60 ms 35144 KB Output is correct
47 Correct 72 ms 35284 KB Output is correct
48 Correct 59 ms 35136 KB Output is correct
49 Correct 61 ms 35152 KB Output is correct
50 Correct 59 ms 35144 KB Output is correct
51 Correct 62 ms 35276 KB Output is correct
52 Correct 63 ms 35104 KB Output is correct
53 Correct 61 ms 35144 KB Output is correct
54 Correct 58 ms 35268 KB Output is correct
55 Correct 57 ms 35052 KB Output is correct
56 Correct 57 ms 35272 KB Output is correct
57 Correct 57 ms 35280 KB Output is correct
58 Correct 63 ms 35164 KB Output is correct
59 Correct 77 ms 35132 KB Output is correct
60 Correct 61 ms 35060 KB Output is correct
61 Execution timed out 1544 ms 56752 KB Time limit exceeded
62 Halted 0 ms 0 KB -