제출 #901577

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
901577		MarwenElarbi	Valley (BOI19_valley)	C++17	0 / 100	163 ms	12628 KiB

valley

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define vi vector<int>
#define ve vector
#define ll long long
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define onbit __builtin_popcount
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e18
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll MOD = 1e9+7;
const int nax = 1e5+5;
const int MAX_VAL = 1e6+1;
double PI=3.14159265359;
int arx[8]={1,0,0,-1,-1,-1, 1, 1};
int ary[8]={0,1,-1, 0, 1,-1,-1, 1};
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
vii adj[nax];
bool shop[nax];
pair<int,int> euler[nax];
int timer=-1;
void dfs(int x,int p)
{
    timer++;
    euler[x].fi=timer;
    for(auto u:adj[x]){
        if(u.fi==p) continue;
        dfs(u.fi,x);
    }
    euler[x].se=timer;
    return;
}
int main(){
    optimise;
    int n,s,q,e;
    cin>>n>>s>>q>>e;
    e--;
    pair<int,int> edges[n-1];
    for (int i = 0; i < n-1; ++i)
    {
        int x,y,z;
        cin>>x>>y>>z;
        x--;y--;
        edges[i]={x,y};
        adj[x].pb({y,z});
        adj[y].pb({x,z});
    }
    dfs(e,-1);
    for (int i = 0; i < s; ++i)
    {
        int x;
        cin>>x;
        x--;
        shop[x]=true;
    }
    /*for (int i = 0; i < n; ++i)
    {
        cout <<euler[i].fi<<" "<<euler[i].se<<endl;
    }*/
    while(q--){
        int i,r;
        cin>>i>>r;
        i--,r--;
        int a=edges[i].fi;
        int b=edges[i].se;
        if(euler[a].fi>euler[b].fi) swap(a,b);
        //cout <<euler[b].fi<<" "<<euler[b].se<<endl;
        if(euler[b].fi>=euler[r].fi&&euler[r].se<=euler[b].se){
            cout <<0<<endl;
        }else cout <<"escaped"<<endl;
    }
}

컴파일 시 표준 에러 (stderr) 메시지

valley.cpp: In function 'void setIO(std::string)':
valley.cpp:35:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
valley.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 27
• Subtask 3: 0 / 23
• Subtask 4: 0 / 41