oj.uz

Submission #1074098

# Submission time Handle Problem Language Result Execution time Memory
1074098 2024-08-25T07:57:32 Z 1ne Wombats (IOI13_wombats) C++14
0 / 100
 128 ms 262144 KB 
#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;
struct node{
  int x,y,d;
};
vector<vector<vector<node>>>adj;
int dist1[200][5000][200];
int dist2[200][5000][200];
int n,m;
void init(int R, int C, int H[5000][200], int V[5000][200]) {
    /* ... */
    n = R,m = C;
   	adj.resize(R,vector<vector<node>>(C));
    for (int i = 0;i<R;++i){
    	for (int j = 0;j<C - 1;++j){
    		adj[i][j].push_back({i,j + 1,H[i][j]});
    		adj[i][j + 1].push_back({i,j,H[i][j]});
    	}
    }
    for (int i = 0;i<R - 1;++i){
    	for (int j = 0;j<C;++j){
    		adj[i][j].push_back({i + 1,j,V[i][j]});
    		adj[i + 1][j].push_back({i,j,V[i][j]});
    	}
    }
    for (int i = 0;i<200;++i){
    	for (int j = 0;j<5000;++j){
    		for (int k = 0;k<200;++k){
    			dist1[i][j][k] = 1e9;
    			dist2[i][j][k] = 1e9;
    		}
    	}
    }
	for (int i = 0;i<C;++i){
		queue<pair<int,int>>q;
		q.push({0,i});
		dist1[i][0][i] = 0;
		while(!q.empty()){
			auto u = q.front();
			q.pop();
			for (auto x:adj[u.first][u.second]){
				if (u.first - x.x > 0)continue;
				if (dist1[i][x.x][x.y] > dist1[i][u.first][u.second] + x.d){
					dist1[i][x.x][x.y] = dist1[i][u.first][u.second] + x.d;
					q.push({x.x,x.y});
				}	
			}
		}
		
	}
	for (int i = 0;i<C;++i){
		queue<pair<int,int>>q;
		q.push({R - 1,i});
		dist2[i][R - 1][i] = 0;
		while(!q.empty()){
			auto u = q.front();
			q.pop();
			for (auto x:adj[u.first][u.second]){
				if (u.first - x.x > 0)continue;
				if (dist2[i][x.x][x.y] > dist2[i][u.first][u.second] + x.d){
					dist2[i][x.x][x.y] = dist2[i][u.first][u.second] + x.d;
					q.push({x.x,x.y});
				}	
			}
		}
	}
}

void changeH(int P, int Q, int W) {
    /* ... */
}

void changeV(int P, int Q, int W) {
    /* ... */
}

int escape(int V1, int V2) {
	//cout<<V1<<" "<<n - 1<<" "<<V2<<" "<<dist1[V1][m - 1][V2]<<'\n';
	return dist1[V1][n - 1][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
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 125 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 114 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 119 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 109 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 128 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 114 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -