oj.uz

Submission #608841

# Submission time Handle Problem Language Result Execution time Memory
608841 2022-07-27T10:41:55 Z MohamedFaresNebili Wombats (IOI13_wombats) C++14
55 / 100
 20000 ms 28288 KB 
#include <bits/stdc++.h>
#include "wombats.h"
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
#pragma GCC optimize("unroll-loops")
 
            using namespace std;
 
            using ll = long long;
            using ii = pair<ll, ll>;
            using vi = vector<int>;
            using pi = pair<int, pair<int, int>>;
 
            #define ff first
            #define ss second
            #define pb push_back
            #define all(x) (x).begin(), (x).end()
            #define lb lower_bound
 
            const int oo = 1000 * 1000 * 1000 + 7;
 
            int R, C, H[5000][200], K[5000][200], DP[100][100];
            bool pr[100];
            void precomputation(int i) {
                priority_queue<pi, vector<pi>, greater<pi>> pq;
                pq.push({0, {0, i}}); vector<vector<int>> D;
                D = vector<vector<int>> (R, vector<int>(C, oo));
                vector<vector<bool>> vis(R, vector<bool>(C, 0));
                D[0][i] = 0;
                while(!pq.empty()) {
                    int U = pq.top().ss.ff, V = pq.top().ss.ss;
                    int W = pq.top().ff; pq.pop();
                    if(W != D[U][V] || vis[U][V]) continue;
                    vis[U][V] = 1;
                    if(V < C - 1) {
                        if(!vis[U][V + 1] && D[U][V + 1] > D[U][V] + H[U][V]) {
                            D[U][V + 1] = D[U][V] + H[U][V];
                            pq.push({D[U][V + 1], {U, V + 1}});
                        }
                    }
                    if(V > 0) {
                        if(!vis[U][V - 1] && D[U][V - 1] > D[U][V] + H[U][V - 1]) {
                            D[U][V - 1] = D[U][V] + H[U][V - 1];
                            pq.push({D[U][V - 1], {U, V - 1}});
                        }
                    }
                    if(U < R - 1) {
                        if(!vis[U + 1][V] && D[U + 1][V] > D[U][V] + K[U][V]) {
                            D[U + 1][V] = D[U][V] + K[U][V];
                            pq.push({D[U + 1][V], {U + 1, V}});
                        }
                    }
                }
                for(int l = 0; l < C; l++)
                    DP[i][l] = D[R - 1][l];
                pr[i] = 1;
            }
            void init(int r, int c, int h[5000][200], int v[5000][200]) {
                R = r, C = c;
                for(int l = 0; l < R; l++)
                    for(int i = 0; i < C; i++)
                        H[l][i] = h[l][i],
                        K[l][i] = v[l][i];
            }
 
            void changeH(int P, int Q, int W) {
                H[P][Q] = W;
                for(int l = 0; l < C; l++) pr[l] = 0;
            }
            void changeV(int P, int Q, int W) {
                K[P][Q] = W;
                for(int l = 0; l < C; l++) pr[l] = 0;
            }
 
            int escape(int V1, int V2) {
                if(!pr[V1]) precomputation(V1);
                return DP[V1][V2];
            }

Compilation message

grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
   15 |  int res;
      |      ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 12688 KB Output is correct
2 Correct 424 ms 12736 KB Output is correct
3 Correct 446 ms 15228 KB Output is correct
4 Correct 361 ms 12692 KB Output is correct
5 Correct 305 ms 12688 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 316 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 75 ms 1736 KB Output is correct
12 Correct 3 ms 340 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 808 KB Output is correct
2 Correct 260 ms 992 KB Output is correct
3 Correct 181 ms 804 KB Output is correct
4 Correct 195 ms 804 KB Output is correct
5 Correct 177 ms 804 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 6 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 125 ms 800 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1648 ms 16640 KB Output is correct
2 Correct 1976 ms 16656 KB Output is correct
3 Correct 1406 ms 16656 KB Output is correct
4 Correct 2211 ms 18008 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 804 KB Output is correct
2 Correct 268 ms 952 KB Output is correct
3 Correct 182 ms 724 KB Output is correct
4 Correct 172 ms 808 KB Output is correct
5 Correct 175 ms 804 KB Output is correct
6 Correct 1606 ms 16632 KB Output is correct
7 Correct 2150 ms 16656 KB Output is correct
8 Correct 1484 ms 16656 KB Output is correct
9 Correct 1445 ms 17944 KB Output is correct
10 Correct 368 ms 12752 KB Output is correct
11 Correct 325 ms 12728 KB Output is correct
12 Correct 423 ms 15428 KB Output is correct
13 Correct 854 ms 12752 KB Output is correct
14 Correct 327 ms 12692 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 312 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 64 ms 2748 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 138 ms 844 KB Output is correct
28 Execution timed out 20025 ms 22112 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 808 KB Output is correct
2 Correct 268 ms 952 KB Output is correct
3 Correct 181 ms 808 KB Output is correct
4 Correct 180 ms 788 KB Output is correct
5 Correct 276 ms 800 KB Output is correct
6 Correct 1489 ms 16644 KB Output is correct
7 Correct 2051 ms 16636 KB Output is correct
8 Correct 1390 ms 16764 KB Output is correct
9 Correct 1570 ms 18012 KB Output is correct
10 Correct 321 ms 12680 KB Output is correct
11 Correct 322 ms 12728 KB Output is correct
12 Correct 372 ms 15392 KB Output is correct
13 Correct 315 ms 12688 KB Output is correct
14 Correct 306 ms 12672 KB Output is correct
15 Incorrect 1037 ms 28288 KB Output isn't correct
16 Halted 0 ms 0 KB -