oj.uz

Submission #1076210

# Submission time Handle Problem Language Result Execution time Memory
1076210 2024-08-26T11:48:38 Z MarwenElarbi Longest Trip (IOI23_longesttrip) C++17
5 / 100
 866 ms 1392 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
#define pb push_back
#define fi first
#define se second
const int nax = 2e5+5;
const int MOD = 1e9+7;

vector<int> adj[256];
bool vis[256];
set<int> components[256];
void dfs(int x,int p){
    components[p].insert(x);
    vis[x]=true;
    for(auto u:adj[x]){
        if(vis[u]) continue;
        dfs(u,p);
    }return;
}
std::vector<int> longest_trip(int N, int D)
{
    vector<int> a,b;
    for (int i = 0; i < N; ++i)
    {
        vis[i]=0;
        adj[i].clear();
        components[i].clear();
    }
    for (int i = 0; i < N; ++i)
    {
        for (int j = i+1; j < N; ++j)
        {
            if(are_connected({i},{j})){
                adj[i].pb(j);
                adj[j].pb(i);
            }else{
                a.pb(i);
                b.pb(j);
            }
        }
    }
    pair<int,int> big={-1,-1};
    int cnt=0;
    for (int i = 0; i < N; ++i)
    {
        if(vis[i]) continue;
        cnt++;
        dfs(i,i);
        if(big.fi<(int)components[i].size()){
            big={(int)components[i].size(),i};
        }
    }
    vector<int> ans;
    if(a.size()==0){
        for (int i = 0; i < N; ++i)
        {
            ans.pb(i);
        }
    }else if(cnt>1){
        for(auto u:components[big.se]){
            ans.pb(u);
        }
    }else{
        memset(vis,0,sizeof vis);
        for(auto u:a){
            if(components[big.se].count(u)) {
                ans.pb(u);
                vis[u]=true;
            }
        }
        for(auto u:b){
            if(components[big.se].count(u)){
                ans.pb(u);
                vis[u]=true;
            }
        }
        for(auto u:components[big.se]){
            if(!vis[u]) ans.pb(u);
        }
    }
    
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 18 ms 344 KB Output is correct
3 Correct 149 ms 344 KB Output is correct
4 Correct 422 ms 744 KB Output is correct
5 Correct 808 ms 712 KB Output is correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 24 ms 344 KB Output is correct
3 Correct 143 ms 344 KB Output is correct
4 Correct 394 ms 344 KB Output is correct
5 Correct 866 ms 720 KB Output is correct
6 Incorrect 1 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 31 ms 340 KB Output is correct
3 Correct 148 ms 460 KB Output is correct
4 Correct 419 ms 512 KB Output is correct
5 Correct 825 ms 1392 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 22 ms 344 KB Output is correct
3 Partially correct 131 ms 468 KB Output is partially correct
4 Partially correct 416 ms 476 KB Output is partially correct
5 Partially correct 798 ms 1008 KB Output is partially correct
6 Incorrect 1 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -