Submission #129036

#	Time	Username	Problem	Language	Result	Execution time	Memory
129036		thanos	Min-max tree (BOI18_minmaxtree)	C++14	0 / 100	1076 ms	15988 KiB

minmaxtree

#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#define pb push_back
using namespace std;
struct edge{
  int x;
  int y;
  int z;
  bool operator<(const edge &rhs)const{return rhs.z<z;};
}q[70005];
struct par{
  int x;
  int y;
  bool operator<(const par &rhs)const{return rhs.x>x;};
};
map<par,int> mym;
vector<int> adj[70005];
bool dfs(int s,int d,int v,bool vis[]){
  vis[s]=true;
  if(s==d){
    return true;
  }
  bool c=false;
  for(int i=0; i<adj[s].size(); i++){
    if(!vis[adj[s].at(i)]){
      if(dfs(adj[s].at(i),d,v,vis)){
        par t; t.x=min(s,adj[s].at(i)); t.y=max(s,adj[s].at(i));
        mym[t]=v;
        c=true;
        break;
      }
    }
  }
  return c;
}
int main(){
  int N;
  cin>>N;
  for(int i=0; i<N-1; i++){
    int t1,t2;
    cin>>t1>>t2;
    adj[t1].pb(t2);
    adj[t2].pb(t1);
    par t; t.x=min(t1,t2); t.y=max(t1,t2);
    mym[t]=-1;
  }
  int K;
  cin>>K;
  for(int i=0; i<K; i++){
    char e;
    cin>>e>>q[i].x>>q[i].y>>q[i].z;
  }
  sort(q,q+K);
  for(int i=0; i<K; i++){
    bool vis[700005]={false};
    dfs(q[i].x,q[i].y,q[i].z,vis);
  }
  for(map<par,int>::iterator it=mym.begin(); it!=mym.end(); it++){
    cout<<(it->first).x<<" "<<(it->first).y<<" "<<it->second<<endl;
  }
  return 0;
}

Compilation message (stderr)

minmaxtree.cpp: In function 'bool dfs(int, int, int, bool*)':
minmaxtree.cpp:26:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<adj[s].size(); i++){
                ~^~~~~~~~~~~~~~

• Subtask 1: 0 / 7
• Subtask 2: 0 / 22
• Subtask 3: 0 / 29
• Subtask 4: 0 / 42