oj.uz

Submission #853085

# Submission time Handle Problem Language Result Execution time Memory
853085 2023-09-23T12:12:20 Z qin Shortcut (IOI16_shortcut) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ssize(x) int(x.size())
#define pn printf("\n");
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
int inf = 1e09; ll infll = 1e18;
struct gr{
		vector<vector<pil>> g;
		vector<ll> dist;
		void init(int n){ g.resize(n), dist.resize(n); }
		void prepare(){ fill(dist.begin(), dist.end(), infll); }
		void dfs(int x, ll d){
				dist[x] = d;
				for(pil u : g[x]) if(d+u.se < dist[u.fi]) dfs(u.fi, d+u.se);
		}
} gr;
ll find_shortcut(int n, vector<int> d_main, vector<int> d_sec, int c){
		gr.init(n<<1);
		for(int i = 0; i < n-1; ++i) gr.g[i].emplace_back(i+1, d_main[i]), gr.g[i+1].emplace_back(i, d_main[i]);
		for(int i = 0; i < n; ++i) gr.g[i].emplace_back(i+n, d_sec[i]), gr.g[i+n].emplace_back(i, d_sec[i]);
		ll result = infll;
		for(int a = 0; a < n-1; ++a)
				for(int b = a+1; b < n; ++b){
						gr.g[a].emplace_back(b, c), gr.g[b].emplace_back(a, c);
						//printf("%d %d: ", a, b);
						gr.prepare(); gr.dfs(0, 0);
						int x = -1; ll d = -1;
						for(int i = 0; i < n<<1; ++i) if(gr.dist[i] != infll && d < gr.dist[i]) x = i, d = gr.dist[i];
						//printf("%d ", x);
						gr.prepare(); gr.dfs(x, 0);
							x = -1, d = -1;
						for(int i = 0; i < n<<1; ++i) if(gr.dist[i] != infll && d < gr.dist[i]) x = i, d = gr.dist[i];
						//printf("%d: %lld\n", x, d);
						result = min(result, d);
						gr.g[a].pop_back(), gr.g[b].pop_back();
				}
		return result;
}
#ifdef LOCAL
int main(){
		int n, c; scanf("%d%d", &n, &c);
		vector<int> d_main(n), d_sec(n);
		for(int i = 0; i < n-1; ++i) scanf("%d", &d_main[i]);
		for(int i = 0; i < n; ++i) scanf("%d", &d_sec[i]);
		ll result = find_shortcut(n, d_main, d_sec, c);
		printf("%lld\n", result);
		return 0;
}
#endif

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 348 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 348 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 348 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 348 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 348 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 348 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 348 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 348 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -