oj.uz

Submission #1114129

# Submission time Handle Problem Language Result Execution time Memory
1114129 2024-11-18T08:23:24 Z SalihSahin Netrpeljivost (COI23_netrpeljivost) C++14
59 / 100
 396 ms 108348 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];
 
void f(int node, int l, int r){
   if(l == r){
      dp[node].resize(1);
      dp[node][0].resize(1);
      dp[node][0][0] = 0;
      return;
   }
 
   int m = (l + r)/2;
   f(node * 2, l, m);
   f(node * 2 + 1, m+1, r);
 
   int sz = (r - l + 1);
   dp[node].resize(sz);
   for(int i = 0; i < sz; i++){
      dp[node][i].resize(sz);
   }
 
   for(int i = 0; i < sz; i++){
      for(int j = 0; j < sz; j++){
         dp[node][i][j] = inf;
      }
   }

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

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

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

   for(int l2 = 0; l2 < sz/2; l2++){
      for(int r1 = 0; r1 < sz/2; r1++){
         for(int l1 = 0; l1 < sz/2; l1++){
            /*
            for(int r2 = 0; r2 < sz/2; r2++){
               dp[node][l2 + sz/2][r1] = min(dp[node][l2 + sz/2][r1], dp[node*2+1][l2][r2] + c[r2 + sz/2 + l][l1 + l] + dp[node*2][l1][r1]);
            }
            */
            dp[node][l2 + sz/2][r1] = min(dp[node][l2 + sz/2][r1], dpr[l2][l1] + dp[node*2][l1][r1]);
         }
      }
   }
}
 
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++){
         cin>>c[i][j];
      }
   }
   f(1, 0, n-1);
 
   int ans = inf;
   for(int l = 0; l < n; l++){
      for(int r = 0; r < n; r++){
         //cout<<l<<" "<<r<<" -> "<<dp[1][l][r]<<endl;
         ans = min(ans, dp[1][l][r]);
      }
   }
   cout<<ans<<endl;
   return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 33616 KB Output is correct
2 Correct 29 ms 33616 KB Output is correct
3 Correct 26 ms 33616 KB Output is correct
4 Correct 33 ms 33656 KB Output is correct
5 Correct 25 ms 33616 KB Output is correct
6 Correct 24 ms 33608 KB Output is correct
7 Correct 26 ms 33608 KB Output is correct
8 Correct 29 ms 33616 KB Output is correct
9 Correct 26 ms 33692 KB Output is correct
10 Correct 28 ms 33608 KB Output is correct
11 Correct 27 ms 33616 KB Output is correct
12 Correct 26 ms 33616 KB Output is correct
13 Correct 26 ms 33540 KB Output is correct
14 Correct 26 ms 33560 KB Output is correct
15 Correct 26 ms 33616 KB Output is correct
16 Correct 25 ms 33616 KB Output is correct
17 Correct 28 ms 33616 KB Output is correct
18 Correct 24 ms 33620 KB Output is correct
19 Correct 25 ms 33616 KB Output is correct
20 Correct 24 ms 33616 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 33616 KB Output is correct
2 Correct 29 ms 33616 KB Output is correct
3 Correct 26 ms 33616 KB Output is correct
4 Correct 33 ms 33656 KB Output is correct
5 Correct 25 ms 33616 KB Output is correct
6 Correct 24 ms 33608 KB Output is correct
7 Correct 26 ms 33608 KB Output is correct
8 Correct 29 ms 33616 KB Output is correct
9 Correct 26 ms 33692 KB Output is correct
10 Correct 28 ms 33608 KB Output is correct
11 Correct 27 ms 33616 KB Output is correct
12 Correct 26 ms 33616 KB Output is correct
13 Correct 26 ms 33540 KB Output is correct
14 Correct 26 ms 33560 KB Output is correct
15 Correct 26 ms 33616 KB Output is correct
16 Correct 25 ms 33616 KB Output is correct
17 Correct 28 ms 33616 KB Output is correct
18 Correct 24 ms 33620 KB Output is correct
19 Correct 25 ms 33616 KB Output is correct
20 Correct 24 ms 33616 KB Output is correct
21 Correct 26 ms 34128 KB Output is correct
22 Correct 27 ms 33872 KB Output is correct
23 Correct 25 ms 34008 KB Output is correct
24 Correct 28 ms 33628 KB Output is correct
25 Correct 28 ms 33616 KB Output is correct
26 Correct 30 ms 34088 KB Output is correct
27 Correct 25 ms 34096 KB Output is correct
28 Correct 30 ms 34128 KB Output is correct
29 Correct 25 ms 34084 KB Output is correct
30 Correct 25 ms 34128 KB Output is correct
31 Correct 25 ms 33864 KB Output is correct
32 Correct 29 ms 34128 KB Output is correct
33 Correct 34 ms 33864 KB Output is correct
34 Correct 31 ms 34092 KB Output is correct
35 Correct 31 ms 34128 KB Output is correct
36 Correct 28 ms 33872 KB Output is correct
37 Correct 28 ms 33864 KB Output is correct
38 Correct 27 ms 33872 KB Output is correct
39 Correct 27 ms 33988 KB Output is correct
40 Correct 29 ms 33876 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 33616 KB Output is correct
2 Correct 29 ms 33616 KB Output is correct
3 Correct 26 ms 33616 KB Output is correct
4 Correct 33 ms 33656 KB Output is correct
5 Correct 25 ms 33616 KB Output is correct
6 Correct 24 ms 33608 KB Output is correct
7 Correct 26 ms 33608 KB Output is correct
8 Correct 29 ms 33616 KB Output is correct
9 Correct 26 ms 33692 KB Output is correct
10 Correct 28 ms 33608 KB Output is correct
11 Correct 27 ms 33616 KB Output is correct
12 Correct 26 ms 33616 KB Output is correct
13 Correct 26 ms 33540 KB Output is correct
14 Correct 26 ms 33560 KB Output is correct
15 Correct 26 ms 33616 KB Output is correct
16 Correct 25 ms 33616 KB Output is correct
17 Correct 28 ms 33616 KB Output is correct
18 Correct 24 ms 33620 KB Output is correct
19 Correct 25 ms 33616 KB Output is correct
20 Correct 24 ms 33616 KB Output is correct
21 Correct 26 ms 34128 KB Output is correct
22 Correct 27 ms 33872 KB Output is correct
23 Correct 25 ms 34008 KB Output is correct
24 Correct 28 ms 33628 KB Output is correct
25 Correct 28 ms 33616 KB Output is correct
26 Correct 30 ms 34088 KB Output is correct
27 Correct 25 ms 34096 KB Output is correct
28 Correct 30 ms 34128 KB Output is correct
29 Correct 25 ms 34084 KB Output is correct
30 Correct 25 ms 34128 KB Output is correct
31 Correct 25 ms 33864 KB Output is correct
32 Correct 29 ms 34128 KB Output is correct
33 Correct 34 ms 33864 KB Output is correct
34 Correct 31 ms 34092 KB Output is correct
35 Correct 31 ms 34128 KB Output is correct
36 Correct 28 ms 33872 KB Output is correct
37 Correct 28 ms 33864 KB Output is correct
38 Correct 27 ms 33872 KB Output is correct
39 Correct 27 ms 33988 KB Output is correct
40 Correct 29 ms 33876 KB Output is correct
41 Correct 134 ms 38888 KB Output is correct
42 Correct 123 ms 41288 KB Output is correct
43 Correct 136 ms 41544 KB Output is correct
44 Correct 127 ms 41404 KB Output is correct
45 Correct 134 ms 41556 KB Output is correct
46 Correct 143 ms 41544 KB Output is correct
47 Correct 137 ms 41544 KB Output is correct
48 Correct 144 ms 41652 KB Output is correct
49 Correct 135 ms 41544 KB Output is correct
50 Correct 133 ms 41548 KB Output is correct
51 Correct 159 ms 41504 KB Output is correct
52 Correct 139 ms 41676 KB Output is correct
53 Correct 142 ms 41544 KB Output is correct
54 Correct 150 ms 41660 KB Output is correct
55 Correct 135 ms 41672 KB Output is correct
56 Correct 143 ms 41544 KB Output is correct
57 Correct 149 ms 41444 KB Output is correct
58 Correct 139 ms 41548 KB Output is correct
59 Correct 137 ms 41544 KB Output is correct
60 Correct 155 ms 41544 KB Output is correct

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 33616 KB Output is correct
2 Correct 29 ms 33616 KB Output is correct
3 Correct 26 ms 33616 KB Output is correct
4 Correct 33 ms 33656 KB Output is correct
5 Correct 25 ms 33616 KB Output is correct
6 Correct 24 ms 33608 KB Output is correct
7 Correct 26 ms 33608 KB Output is correct
8 Correct 29 ms 33616 KB Output is correct
9 Correct 26 ms 33692 KB Output is correct
10 Correct 28 ms 33608 KB Output is correct
11 Correct 27 ms 33616 KB Output is correct
12 Correct 26 ms 33616 KB Output is correct
13 Correct 26 ms 33540 KB Output is correct
14 Correct 26 ms 33560 KB Output is correct
15 Correct 26 ms 33616 KB Output is correct
16 Correct 25 ms 33616 KB Output is correct
17 Correct 28 ms 33616 KB Output is correct
18 Correct 24 ms 33620 KB Output is correct
19 Correct 25 ms 33616 KB Output is correct
20 Correct 24 ms 33616 KB Output is correct
21 Correct 26 ms 34128 KB Output is correct
22 Correct 27 ms 33872 KB Output is correct
23 Correct 25 ms 34008 KB Output is correct
24 Correct 28 ms 33628 KB Output is correct
25 Correct 28 ms 33616 KB Output is correct
26 Correct 30 ms 34088 KB Output is correct
27 Correct 25 ms 34096 KB Output is correct
28 Correct 30 ms 34128 KB Output is correct
29 Correct 25 ms 34084 KB Output is correct
30 Correct 25 ms 34128 KB Output is correct
31 Correct 25 ms 33864 KB Output is correct
32 Correct 29 ms 34128 KB Output is correct
33 Correct 34 ms 33864 KB Output is correct
34 Correct 31 ms 34092 KB Output is correct
35 Correct 31 ms 34128 KB Output is correct
36 Correct 28 ms 33872 KB Output is correct
37 Correct 28 ms 33864 KB Output is correct
38 Correct 27 ms 33872 KB Output is correct
39 Correct 27 ms 33988 KB Output is correct
40 Correct 29 ms 33876 KB Output is correct
41 Correct 134 ms 38888 KB Output is correct
42 Correct 123 ms 41288 KB Output is correct
43 Correct 136 ms 41544 KB Output is correct
44 Correct 127 ms 41404 KB Output is correct
45 Correct 134 ms 41556 KB Output is correct
46 Correct 143 ms 41544 KB Output is correct
47 Correct 137 ms 41544 KB Output is correct
48 Correct 144 ms 41652 KB Output is correct
49 Correct 135 ms 41544 KB Output is correct
50 Correct 133 ms 41548 KB Output is correct
51 Correct 159 ms 41504 KB Output is correct
52 Correct 139 ms 41676 KB Output is correct
53 Correct 142 ms 41544 KB Output is correct
54 Correct 150 ms 41660 KB Output is correct
55 Correct 135 ms 41672 KB Output is correct
56 Correct 143 ms 41544 KB Output is correct
57 Correct 149 ms 41444 KB Output is correct
58 Correct 139 ms 41548 KB Output is correct
59 Correct 137 ms 41544 KB Output is correct
60 Correct 155 ms 41544 KB Output is correct
61 Runtime error 396 ms 108348 KB Execution killed with signal 6
62 Halted 0 ms 0 KB -