Submission #426577

#	Time	Username	Problem	Language	Result	Execution time	Memory
426577		juggernaut	Bitaro’s Party (JOI18_bitaro)	C++17	0 / 100	3 ms	3020 KiB

bitaro

#include<bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
void usaco(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
typedef long long ll;
#define USING_ORDERED_SET 0
#if USING_ORDERED_SET
#include<bits/extc++.h>
using namespace __gnu_pbds;
template<class T>using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#endif
template<class T>void umax(T &a,T b){if(a<b)a=b;}
template<class T>void umin(T &a,T b){if(b<a)a=b;}
#ifdef IOI2021SG
    #define printl(args...)printf(args)
#else
    #define printl(args...)((void)0)
#endif
int n,m,q;
vector<int>g[100005];
int dp[100005];
bool vis[100005];
bool locked[100005];
int get(int v){
    if(vis[v])return dp[v];
    vis[v]=true;
    if(!locked[v])dp[v]=0;
    for(int to:g[v])umax(dp[v],get(to)+1);
    return dp[v];
}

int par[100005];
int sz[100005];
bool cmp(pair<int,int>l,pair<int,int>r){
    return l.sc-l.fr>r.sc-r.fr;
}
int fin(int v){
    return v==par[v]?v:par[v]=fin(par[v]);
}
void unite(int a,int b,int x,int y){
    a=fin(a);
    b=fin(b);
    if(a^b){
        if(sz[a]<sz[b])swap(a,b);
        sz[a]+=sz[b];
        par[b]=a;
        g[y].push_back(x);
    }
}
int main(){
    memset(dp,-1,sizeof dp);
    scanf("%d%d%d",&n,&m,&q);
    iota(par+1,par+1+n,1);
    fill(sz+1,sz+1+n,1);
    vector<pair<int,int>>vec;
    while(m--){
        int x,y;
        scanf("%d%d",&x,&y);
        vec.emplace_back(x,y);
    }
    sort(vec.begin(),vec.end(),cmp);
    while(!vec.empty()){
        unite(vec.back().fr,vec.back().sc,vec.back().fr,vec.back().sc);
        vec.pop_back();
    }
    int v;
    scanf("%d",&v);
    scanf("%d",&m);
    while(m--){
        int x;
        scanf("%d",&x);
        locked[x]=true;
        dp[x]=-1e9;
    }
    int y=max(-1,get(v));
    cout<<y;
}

Compilation message (stderr)

bitaro.cpp: In function 'void usaco(std::string)':
bitaro.cpp:5:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | void usaco(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:5:66: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | void usaco(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                                                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp: In function 'int main()':
bitaro.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |     scanf("%d%d%d",&n,&m,&q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
bitaro.cpp:59:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |         scanf("%d%d",&x,&y);
      |         ~~~~~^~~~~~~~~~~~~~
bitaro.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |     scanf("%d",&v);
      |     ~~~~~^~~~~~~~~
bitaro.cpp:69:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |     scanf("%d",&m);
      |     ~~~~~^~~~~~~~~
bitaro.cpp:72:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |         scanf("%d",&x);
      |         ~~~~~^~~~~~~~~

• Subtask 1: 0 / 7
• Subtask 2: 0 / 7
• Subtask 3: 0 / 86