제출 #466344

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
466344		MohamedAliSaidane	Islands (IOI08_islands)	C++14	6 / 100	2099 ms	131072 KiB

islands

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pld;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpi;

#define pb push_back
#define popb pop_back
#define all(v) (v).begin(),(v).end()
#define ff first
#define ss second

const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int MAX_N = 4005;
int n;
ll adj[MAX_N][MAX_N];
bool visited[MAX_N];

ll dfs(int u)
{
    visited[u] = true;
    ll maxt = 0;
    for(int i = 1; i <= n; i ++)
    {
        if(visited[i])
            continue;
        maxt = max(maxt,dfs(i)+adj[u][i]);
    }
    visited[u] = false;
    return maxt;

}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    memset(adj,0,sizeof(adj));
    cin >> n;
    for(int i = 1; i <=n; i ++)
    {
        ll u, dist;
        cin >> u >> dist;
        adj[i][u] = adj[u][i] = max(adj[i][u],dist);
    }
    ll ans = 0;
    for(int i = 1; i <=n; i ++)
    {
        ans=max(ans,dfs(i));
    }
    cout << ans;
}
/*
Sample test case:
7
3 8
7 2
4 2
1 4
1 9
3 4
2 3
*/

• Subtask 1: 6 / 33
• Subtask 2: 0 / 3
• Subtask 3: 0 / 4
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10