oj.uz

답안 #289117

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
289117 2020-09-02T11:18:34 Z egekabas 웜뱃 (IOI13_wombats) C++14
55 / 100
 20000 ms 19712 KB 
#include "wombats.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int r, c;
const int sq = 700;
int h[5000][200];
int v[5000][200];
int dis[5000/sq+5][200][200];
void dijkstra1(int beg, int end, int imp, int dis[200]){
    for(int j = 0; j < c; ++j)
        dis[j] = 1e9+7;
    dis[imp] = 0;
    for(int i = end; i >= beg; --i){
        for(int j = 1; j < c; ++j)
            dis[j] = min(dis[j], dis[j-1]+h[i][j-1]);
        for(int j = c-2; j >= 0; --j)
            dis[j] = min(dis[j], dis[j+1]+h[i][j]);
        for(int j = 0; j < c && i != beg; ++j)
            dis[j] = min((int)1e9+7, dis[j] + v[i-1][j]);
    }
}
int segdis[200][5000/sq+5][200];
int cnt;
void dijkstra2(int start, int d[5000/sq+5][200]){
    for(int i = 0; i < r; i += sq){
        for(int j = 0; j < c; ++j)
            d[i/sq][j] = d[i/sq+1][j] = 1e9+7;
        cnt = max(cnt, i/sq+1);
    }
    d[0][start] = 0;
    for(int i = 0; i < r; i += sq)
        for(int j = 0; j < c; ++j)
            for(int k = 0; k < c; ++k){
                d[i/sq+1][k] = min(d[i/sq+1][k], d[i/sq][j] + dis[i/sq][k][j]);
            }
}


void init(int R, int C, int H[5000][200], int V[5000][200]) {
    r = R;
    c = C;
    for(int i = 0; i < r; ++i)
        for(int j = 0; j < c; ++j){
            h[i][j] = H[i][j];
            v[i][j] = V[i][j];
        }
    for(int i = 0; i < r; i += sq)
        for(int j = 0; j < c; ++j)
            dijkstra1(i, min(i+sq, r-1), j, dis[i/sq][j]);
    for(int j = 0; j < c; ++j)
        dijkstra2(j,  segdis[j]);
}
vector<int> change;
void changeH(int P, int Q, int W) {
    h[P][Q] = W;
    int gr = P/sq;
    change.pb(gr);
    if(gr > 0 && P%sq == 0){
        change.pb(gr-1);
    }
}
    
void changeV(int P, int Q, int W) {
    v[P][Q] = W;
    int gr = P/sq;
    change.pb(gr);
}
int curd[200];
int newd[200];
int done[sq+5];
int escape(int V1, int V2) {
    for(auto u : change){
        if(done[u]) continue;
        for(int j = 0; j < c; ++j)
            dijkstra1(u*sq, min(r-1, (u+1)*sq), j, dis[u][j]);
    }
    if(change.size())
        for(int j = 0; j < c; ++j)
            dijkstra2(j, segdis[j]);
    for(auto u : change)
        done[u] = 0;
    change.clear();
    return segdis[V1][cnt][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

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 12160 KB Output is correct
2 Correct 10 ms 12160 KB Output is correct
3 Correct 96 ms 13724 KB Output is correct
4 Correct 10 ms 12160 KB Output is correct
5 Correct 10 ms 12160 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 85 ms 1528 KB Output is correct
12 Correct 1 ms 512 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 966 ms 1328 KB Output is correct
2 Correct 1014 ms 1400 KB Output is correct
3 Correct 1039 ms 1400 KB Output is correct
4 Correct 1063 ms 1400 KB Output is correct
5 Correct 1016 ms 1400 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 4619 ms 1308 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 16000 KB Output is correct
2 Correct 20 ms 16000 KB Output is correct
3 Correct 23 ms 16128 KB Output is correct
4 Correct 64 ms 16888 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 958 ms 1300 KB Output is correct
2 Correct 1006 ms 1300 KB Output is correct
3 Correct 1041 ms 1400 KB Output is correct
4 Correct 1049 ms 1308 KB Output is correct
5 Correct 1010 ms 1400 KB Output is correct
6 Correct 20 ms 16000 KB Output is correct
7 Correct 20 ms 16000 KB Output is correct
8 Correct 20 ms 16000 KB Output is correct
9 Correct 62 ms 16984 KB Output is correct
10 Correct 10 ms 12288 KB Output is correct
11 Correct 10 ms 12160 KB Output is correct
12 Correct 93 ms 13688 KB Output is correct
13 Correct 10 ms 12160 KB Output is correct
14 Correct 10 ms 12160 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 88 ms 1528 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 4612 ms 1304 KB Output is correct
28 Execution timed out 20055 ms 18204 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 961 ms 1408 KB Output is correct
2 Correct 999 ms 1400 KB Output is correct
3 Correct 1047 ms 1308 KB Output is correct
4 Correct 1048 ms 1280 KB Output is correct
5 Correct 1008 ms 1400 KB Output is correct
6 Correct 20 ms 16000 KB Output is correct
7 Correct 21 ms 16000 KB Output is correct
8 Correct 21 ms 16000 KB Output is correct
9 Correct 63 ms 16848 KB Output is correct
10 Correct 10 ms 12160 KB Output is correct
11 Correct 10 ms 12160 KB Output is correct
12 Correct 94 ms 13816 KB Output is correct
13 Correct 10 ms 12160 KB Output is correct
14 Correct 10 ms 12288 KB Output is correct
15 Correct 3481 ms 19292 KB Output is correct
16 Execution timed out 20060 ms 19712 KB Time limit exceeded
17 Halted 0 ms 0 KB -