oj.uz

Submission #483679

# Submission time Handle Problem Language Result Execution time Memory
483679 2021-10-31T16:47:24 Z PoPularPlusPlus Crocodile's Underground City (IOI11_crocodile) C++17
46 / 100
 2 ms 716 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

vector<pair<int,ll>	> adj[1003];
bool vis[1003];
ll dp[1003];

void dfs(int node){
	vis[node] = 1;
	vector<int> v;
	for(auto it : adj[node]){
		int j = it.vf , w = it.vs;
		if(!vis[j]){
			dfs(j);
			v.pb(w + dp[j]);
		}
	}
	sv(v);
	if(v.size() != 0)
	dp[node] = v[1];
	else dp[node] = 0;
}

int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]){
	for(int i = 0; i < m; i++){
		adj[r[i][0]].pb(mp(r[i][1] , l[i]));
		adj[r[i][1]].pb(mp(r[i][0] , l[i]));
	}
	memset(vis,0,sizeof vis);
	dfs(0);
	return dp[0];
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 460 KB Output is correct

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Incorrect 2 ms 716 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Incorrect 2 ms 716 KB Output isn't correct
10 Halted 0 ms 0 KB -