oj.uz

답안 #283479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283479 2020-08-25T20:14:06 Z shayan_p 웜뱃 (IOI13_wombats) C++14
55 / 100
 20000 ms 64888 KB 
// And you curse yourself for things you never done

#include<bits/stdc++.h>
#include "wombats.h"

#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

const int maxn = 5010, maxm = 210, SQ = 20, mod = 1e9 + 7, inf = 1e9 + 10;

int n, m;
int tmp[maxm][maxm], opt[maxm][maxm];

void knuth(int a[maxm][maxm], int b[maxm][maxm], int ans[maxm][maxm]){
    for(int i = 0; i < m; i++){
	for(int j = 0; j < m; j++)
	    tmp[i][j] = inf;
    }
    
    for(int i = 0; i < m; i++)
	for(int j = 0; j < m; j++)
	    for(int k = 0; k < m; k++)
		tmp[i][j] = min(tmp[i][j], a[i][k] + b[k][j]);
    for(int i = 0; i < m; i++)
	for(int j = 0; j < m; j++)
	    ans[i][j] = tmp[i][j];		
    return;
    
    for(int i = 0; i < m; i++){
	for(int j = 0; j < m; j++){
	    int x = a[i][j] + b[j][i];
	    if(x < tmp[i][i])
		opt[i][i] = j, tmp[i][i] = x;
	}
    }
    for(int ln = 1; ln < m; ln++){
	for(int i = 0; i < m; i++){
	    int j = i + ln;
	    for(int k = opt[i][j-1]; k <= opt[i+1][j]; k++){
		int x = a[i][k] + b[k][j];
		if(x < tmp[i][j])
		    opt[i][j] = k, tmp[i][j] = x;
	    }
	}
    }
    for(int ln = 1; ln < m; ln++){
	for(int i = ln; i < m; i++){
	    int j = i - ln;
	    for(int k = opt[i-1][j]; k <= opt[i][j+1]; k++){
		int x = a[i][k] + b[k][j];
		if(x < tmp[i][j])
		    opt[i][j] = k, tmp[i][j] = x;
	    }
	}
    }
    for(int i = 0; i < m; i++){
	for(int j = 0; j < m; j++)
	    ans[i][j] = tmp[i][j];
    }
}

int cx[maxn][maxm], cy[maxn][maxm];

int ds[4 * (maxn / SQ +1)][maxm][maxm];

int tmp2[maxm][maxm];

void restart(int l, int r, int ans[maxm][maxm]){
    for(int a = 0; a < m; a++){
	ans[a][a] = 0;
	for(int b = a+1; b < m; b++)
	    ans[a][b] = ans[a][b-1] + cy[l][b-1];
	for(int b = a-1; b >= 0; b--)
	    ans[a][b] = ans[a][b+1] + cy[l][b];
    }
    for(int w = l+1; w <= r; w++){
	for(int a = 0; a < m; a++){
	    tmp2[a][a] = cx[w-1][a];
	    for(int b = a+1; b < m; b++)
		tmp2[a][b] = tmp2[a][b-1] + cy[w][b-1];
	    for(int b = a-1; b >= 0; b--)
		tmp2[a][b] = tmp2[a][b+1] + cy[w][b];
	}
	knuth(ans, tmp2, ans);
    }
}
void build(int l = 0, int r = n, int id = 1){
    if(r-l <= SQ){
	restart(l, r, ds[id]);
	return;
    }
    int mid = (l+r) >> 1;
    build(l, mid, 2*id);
    build(mid, r, 2*id+1);
    knuth(ds[2*id], ds[2*id+1], ds[id]);
}
void change(int pos, int l = 0, int r = n, int id = 1){
    if(r < pos || pos < l)
	return;
    if(r-l <= SQ){
	restart(l, r, ds[id]);
	return;	    
    }
    int mid = (l+r) >> 1;
    change(pos, l, mid, 2*id);
    change(pos, mid, r, 2*id+1);
    knuth(ds[2*id], ds[2*id+1], ds[id]);
}
void init(int n, int m, int H[5000][200], int V[5000][200]){
    --n;
    ::n = n, ::m = m;
    for(int i = 0; i <= n; i++){
	for(int j = 0; j < m; j++)
	    cy[i][j] = H[i][j], cx[i][j] = V[i][j];
    }
    build();    
}
void changeH(int P, int Q, int W) {// Y
    cy[P][Q] = W;
    change(P);
}
void changeV(int P, int Q, int W){ // X
    cx[P][Q] = W;
    change(P);
}
int escape(int V1, int V2){
    return ds[1][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

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14720 KB Output is correct
2 Correct 10 ms 14720 KB Output is correct
3 Correct 94 ms 17528 KB Output is correct
4 Correct 10 ms 14720 KB Output is correct
5 Correct 10 ms 14720 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 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 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 98 ms 2808 KB Output is correct
12 Correct 1 ms 512 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2164 ms 2256 KB Output is correct
2 Correct 2102 ms 2296 KB Output is correct
3 Correct 2216 ms 2168 KB Output is correct
4 Correct 2128 ms 2308 KB Output is correct
5 Correct 2159 ms 2296 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 10420 ms 2264 KB Output is correct
10 Correct 0 ms 384 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 19072 KB Output is correct
2 Correct 14 ms 19072 KB Output is correct
3 Correct 14 ms 19072 KB Output is correct
4 Correct 57 ms 20528 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2163 ms 2296 KB Output is correct
2 Correct 2138 ms 2264 KB Output is correct
3 Correct 2254 ms 2260 KB Output is correct
4 Correct 2228 ms 2272 KB Output is correct
5 Correct 2156 ms 2296 KB Output is correct
6 Correct 13 ms 19072 KB Output is correct
7 Correct 13 ms 19072 KB Output is correct
8 Correct 13 ms 19072 KB Output is correct
9 Correct 56 ms 20472 KB Output is correct
10 Correct 10 ms 14720 KB Output is correct
11 Correct 10 ms 14720 KB Output is correct
12 Correct 94 ms 17528 KB Output is correct
13 Correct 10 ms 14720 KB Output is correct
14 Correct 10 ms 14720 KB Output is correct
15 Correct 0 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 640 KB Output is correct
23 Correct 1 ms 640 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 87 ms 2856 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 10253 ms 2260 KB Output is correct
28 Execution timed out 20087 ms 64888 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2133 ms 2424 KB Output is correct
2 Correct 2080 ms 2424 KB Output is correct
3 Correct 2234 ms 2296 KB Output is correct
4 Correct 2130 ms 2296 KB Output is correct
5 Correct 2162 ms 2168 KB Output is correct
6 Correct 13 ms 19072 KB Output is correct
7 Correct 13 ms 19072 KB Output is correct
8 Correct 14 ms 19072 KB Output is correct
9 Correct 55 ms 20472 KB Output is correct
10 Correct 10 ms 14720 KB Output is correct
11 Correct 10 ms 14720 KB Output is correct
12 Correct 96 ms 17528 KB Output is correct
13 Correct 10 ms 14720 KB Output is correct
14 Correct 10 ms 14720 KB Output is correct
15 Execution timed out 20095 ms 53044 KB Time limit exceeded
16 Halted 0 ms 0 KB -