oj.uz

Submission #1114135

# Submission time Handle Problem Language Result Execution time Memory
1114135 2024-11-18T08:32:43 Z SalihSahin Netrpeljivost (COI23_netrpeljivost) C++14
59 / 100
 390 ms 83508 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(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);

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

      ans = inf;
      for(int i = 0; i < sz/2; i++){
         for(int j = 0; j < sz/2; j++){
            ans = min(ans, ldp[j] + c[j + l][i + l + sz/2] + rdp[i]);
         }
      }
      return;
   }
 
   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> > dp2(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++){
            dp2[l1][l2] = min(dp2[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++){
            dp[node][l1][r2 + sz/2] = min(dp[node][l1][r2 + sz/2], dp2[l1][l2] + dp[node*2+1][l2][r2]);
         }
      }
   }

   for(int i = 0; i < sz/2; i++){
      for(int j = 0; j < sz/2; j++){
         dp2[i][j] = 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++){
            dp2[l2][l1] = min(dp2[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++){
            dp[node][l2 + sz/2][r1] = min(dp[node][l2 + sz/2][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++){
         cin>>c[i][j];
      }
   }
   f(1, 0, n-1);
   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 24 ms 33688 KB Output is correct
3 Correct 23 ms 33616 KB Output is correct
4 Correct 24 ms 33652 KB Output is correct
5 Correct 23 ms 33892 KB Output is correct
6 Correct 27 ms 33616 KB Output is correct
7 Correct 31 ms 33616 KB Output is correct
8 Correct 23 ms 33616 KB Output is correct
9 Correct 25 ms 33608 KB Output is correct
10 Correct 27 ms 33740 KB Output is correct
11 Correct 25 ms 33608 KB Output is correct
12 Correct 22 ms 33616 KB Output is correct
13 Correct 25 ms 33616 KB Output is correct
14 Correct 28 ms 33732 KB Output is correct
15 Correct 28 ms 33624 KB Output is correct
16 Correct 26 ms 33616 KB Output is correct
17 Correct 25 ms 33616 KB Output is correct
18 Correct 25 ms 33484 KB Output is correct
19 Correct 25 ms 33616 KB Output is correct
20 Correct 25 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 24 ms 33688 KB Output is correct
3 Correct 23 ms 33616 KB Output is correct
4 Correct 24 ms 33652 KB Output is correct
5 Correct 23 ms 33892 KB Output is correct
6 Correct 27 ms 33616 KB Output is correct
7 Correct 31 ms 33616 KB Output is correct
8 Correct 23 ms 33616 KB Output is correct
9 Correct 25 ms 33608 KB Output is correct
10 Correct 27 ms 33740 KB Output is correct
11 Correct 25 ms 33608 KB Output is correct
12 Correct 22 ms 33616 KB Output is correct
13 Correct 25 ms 33616 KB Output is correct
14 Correct 28 ms 33732 KB Output is correct
15 Correct 28 ms 33624 KB Output is correct
16 Correct 26 ms 33616 KB Output is correct
17 Correct 25 ms 33616 KB Output is correct
18 Correct 25 ms 33484 KB Output is correct
19 Correct 25 ms 33616 KB Output is correct
20 Correct 25 ms 33616 KB Output is correct
21 Correct 25 ms 33636 KB Output is correct
22 Correct 26 ms 33872 KB Output is correct
23 Correct 24 ms 33720 KB Output is correct
24 Correct 24 ms 33616 KB Output is correct
25 Correct 33 ms 33616 KB Output is correct
26 Correct 24 ms 33872 KB Output is correct
27 Correct 30 ms 33872 KB Output is correct
28 Correct 25 ms 33864 KB Output is correct
29 Correct 26 ms 34040 KB Output is correct
30 Correct 24 ms 33888 KB Output is correct
31 Correct 25 ms 33872 KB Output is correct
32 Correct 26 ms 33688 KB Output is correct
33 Correct 27 ms 33872 KB Output is correct
34 Correct 27 ms 33616 KB Output is correct
35 Correct 26 ms 33872 KB Output is correct
36 Correct 25 ms 33872 KB Output is correct
37 Correct 27 ms 33616 KB Output is correct
38 Correct 29 ms 33864 KB Output is correct
39 Correct 29 ms 33872 KB Output is correct
40 Correct 29 ms 34004 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 24 ms 33688 KB Output is correct
3 Correct 23 ms 33616 KB Output is correct
4 Correct 24 ms 33652 KB Output is correct
5 Correct 23 ms 33892 KB Output is correct
6 Correct 27 ms 33616 KB Output is correct
7 Correct 31 ms 33616 KB Output is correct
8 Correct 23 ms 33616 KB Output is correct
9 Correct 25 ms 33608 KB Output is correct
10 Correct 27 ms 33740 KB Output is correct
11 Correct 25 ms 33608 KB Output is correct
12 Correct 22 ms 33616 KB Output is correct
13 Correct 25 ms 33616 KB Output is correct
14 Correct 28 ms 33732 KB Output is correct
15 Correct 28 ms 33624 KB Output is correct
16 Correct 26 ms 33616 KB Output is correct
17 Correct 25 ms 33616 KB Output is correct
18 Correct 25 ms 33484 KB Output is correct
19 Correct 25 ms 33616 KB Output is correct
20 Correct 25 ms 33616 KB Output is correct
21 Correct 25 ms 33636 KB Output is correct
22 Correct 26 ms 33872 KB Output is correct
23 Correct 24 ms 33720 KB Output is correct
24 Correct 24 ms 33616 KB Output is correct
25 Correct 33 ms 33616 KB Output is correct
26 Correct 24 ms 33872 KB Output is correct
27 Correct 30 ms 33872 KB Output is correct
28 Correct 25 ms 33864 KB Output is correct
29 Correct 26 ms 34040 KB Output is correct
30 Correct 24 ms 33888 KB Output is correct
31 Correct 25 ms 33872 KB Output is correct
32 Correct 26 ms 33688 KB Output is correct
33 Correct 27 ms 33872 KB Output is correct
34 Correct 27 ms 33616 KB Output is correct
35 Correct 26 ms 33872 KB Output is correct
36 Correct 25 ms 33872 KB Output is correct
37 Correct 27 ms 33616 KB Output is correct
38 Correct 29 ms 33864 KB Output is correct
39 Correct 29 ms 33872 KB Output is correct
40 Correct 29 ms 34004 KB Output is correct
41 Correct 62 ms 36680 KB Output is correct
42 Correct 68 ms 36144 KB Output is correct
43 Correct 64 ms 35280 KB Output is correct
44 Correct 64 ms 35144 KB Output is correct
45 Correct 64 ms 35144 KB Output is correct
46 Correct 78 ms 36936 KB Output is correct
47 Correct 64 ms 36936 KB Output is correct
48 Correct 66 ms 36680 KB Output is correct
49 Correct 63 ms 35144 KB Output is correct
50 Correct 63 ms 36684 KB Output is correct
51 Correct 63 ms 35964 KB Output is correct
52 Correct 87 ms 35400 KB Output is correct
53 Correct 60 ms 36680 KB Output is correct
54 Correct 63 ms 36224 KB Output is correct
55 Correct 63 ms 35912 KB Output is correct
56 Correct 63 ms 35228 KB Output is correct
57 Correct 63 ms 35860 KB Output is correct
58 Correct 64 ms 35912 KB Output is correct
59 Correct 70 ms 36176 KB Output is correct
60 Correct 62 ms 35144 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 24 ms 33688 KB Output is correct
3 Correct 23 ms 33616 KB Output is correct
4 Correct 24 ms 33652 KB Output is correct
5 Correct 23 ms 33892 KB Output is correct
6 Correct 27 ms 33616 KB Output is correct
7 Correct 31 ms 33616 KB Output is correct
8 Correct 23 ms 33616 KB Output is correct
9 Correct 25 ms 33608 KB Output is correct
10 Correct 27 ms 33740 KB Output is correct
11 Correct 25 ms 33608 KB Output is correct
12 Correct 22 ms 33616 KB Output is correct
13 Correct 25 ms 33616 KB Output is correct
14 Correct 28 ms 33732 KB Output is correct
15 Correct 28 ms 33624 KB Output is correct
16 Correct 26 ms 33616 KB Output is correct
17 Correct 25 ms 33616 KB Output is correct
18 Correct 25 ms 33484 KB Output is correct
19 Correct 25 ms 33616 KB Output is correct
20 Correct 25 ms 33616 KB Output is correct
21 Correct 25 ms 33636 KB Output is correct
22 Correct 26 ms 33872 KB Output is correct
23 Correct 24 ms 33720 KB Output is correct
24 Correct 24 ms 33616 KB Output is correct
25 Correct 33 ms 33616 KB Output is correct
26 Correct 24 ms 33872 KB Output is correct
27 Correct 30 ms 33872 KB Output is correct
28 Correct 25 ms 33864 KB Output is correct
29 Correct 26 ms 34040 KB Output is correct
30 Correct 24 ms 33888 KB Output is correct
31 Correct 25 ms 33872 KB Output is correct
32 Correct 26 ms 33688 KB Output is correct
33 Correct 27 ms 33872 KB Output is correct
34 Correct 27 ms 33616 KB Output is correct
35 Correct 26 ms 33872 KB Output is correct
36 Correct 25 ms 33872 KB Output is correct
37 Correct 27 ms 33616 KB Output is correct
38 Correct 29 ms 33864 KB Output is correct
39 Correct 29 ms 33872 KB Output is correct
40 Correct 29 ms 34004 KB Output is correct
41 Correct 62 ms 36680 KB Output is correct
42 Correct 68 ms 36144 KB Output is correct
43 Correct 64 ms 35280 KB Output is correct
44 Correct 64 ms 35144 KB Output is correct
45 Correct 64 ms 35144 KB Output is correct
46 Correct 78 ms 36936 KB Output is correct
47 Correct 64 ms 36936 KB Output is correct
48 Correct 66 ms 36680 KB Output is correct
49 Correct 63 ms 35144 KB Output is correct
50 Correct 63 ms 36684 KB Output is correct
51 Correct 63 ms 35964 KB Output is correct
52 Correct 87 ms 35400 KB Output is correct
53 Correct 60 ms 36680 KB Output is correct
54 Correct 63 ms 36224 KB Output is correct
55 Correct 63 ms 35912 KB Output is correct
56 Correct 63 ms 35228 KB Output is correct
57 Correct 63 ms 35860 KB Output is correct
58 Correct 64 ms 35912 KB Output is correct
59 Correct 70 ms 36176 KB Output is correct
60 Correct 62 ms 35144 KB Output is correct
61 Runtime error 390 ms 83508 KB Execution killed with signal 6
62 Halted 0 ms 0 KB -