Submission #334473

#	Time	Username	Problem	Language	Result	Execution time	Memory
334473		beksultan04	Evacuation plan (IZhO18_plan)	C++14	23 / 100	4067 ms	31852 KiB

plan

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define pb push_back
#define endi puts("");
const int N = 1e5+12,INF=1e9+7;
int dist[N],n,yy,ans;
vector <pii> g[N];
bool is[N];
void fun(int v){
    int i,j,k;
    set <pii> s;
    s.insert({0,v});
    dist[v] = 0;
    while (!s.empty()){

        pii x = *s.begin();
        s.erase(s.begin());
        for (i=0;i<g[x.sc].size();++i){
            if (dist[g[x.sc][i].fr] > dist[x.sc]+g[x.sc][i].sc){
                s.erase({dist[g[x.sc][i].fr],g[x.sc][i].fr});
                dist[g[x.sc][i].fr] = dist[x.sc]+g[x.sc][i].sc;
                s.insert({dist[g[x.sc][i].fr],g[x.sc][i].fr});
            }
        }
    }
}
vector <int> v;
void dfs(int x){
    int i;
    v.pb(x);
    if (x == yy){
        int mn = INF;
        for (i=0;i<v.size();++i){
            mn = min(mn,dist[v[i]]);
        }
        ans=max(ans,mn);

    }
    for (i=0;i<g[x].size();++i){
        if (is[g[x][i].fr]==0){
            is[g[x][i].fr]=1;
            dfs(g[x][i].fr);
            is[g[x][i].fr]=0;
        }
    }
    v.pop_back();
}

main(){
    int m,i,j;
    scan2(n,m)
    for (i=1;i<=n;++i)dist[i]=INF;
    while (m--){
        int x,y,z;
        scan3(x,y,z)
        g[x].pb({y,z});
        g[y].pb({x,z});
    }
    scan1(m)
    while (m--){
        int x;
        scan1(x)
        fun(x);
    }
    scan1(m)
    if (m == 1 || n <= 15){
        while (m--){
            ans = 0;
            int x;
            scan2(x,yy)
            is[x]=1;
            dfs(x);
            is[x]=0;
            cout <<ans<<"\n";
        }
    }

    else
        while (m--){
            int x,y;
            scan2(x,y)
            cout <<min(dist[x],dist[y])<<"\n";
        }
}

Compilation message (stderr)

plan.cpp: In function 'void fun(long long int)':
plan.cpp:28:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         for (i=0;i<g[x.sc].size();++i){
      |                  ~^~~~~~~~~~~~~~~
plan.cpp:20:11: warning: unused variable 'j' [-Wunused-variable]
   20 |     int i,j,k;
      |           ^
plan.cpp:20:13: warning: unused variable 'k' [-Wunused-variable]
   20 |     int i,j,k;
      |             ^
plan.cpp: In function 'void dfs(long long int)':
plan.cpp:43:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for (i=0;i<v.size();++i){
      |                  ~^~~~~~~~~
plan.cpp:49:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     for (i=0;i<g[x].size();++i){
      |              ~^~~~~~~~~~~~
plan.cpp: At global scope:
plan.cpp:59:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   59 | main(){
      |      ^
plan.cpp: In function 'int main()':
plan.cpp:60:13: warning: unused variable 'j' [-Wunused-variable]
   60 |     int m,i,j;
      |             ^
plan.cpp:10:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 | #define scan2(a,b) scanf("%lld %lld",&a, &b);
      |                    ~~~~~^~~~~~~~~~~~~~~~~~~~
plan.cpp:61:5: note: in expansion of macro 'scan2'
   61 |     scan2(n,m)
      |     ^~~~~
plan.cpp:11:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 | #define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:65:9: note: in expansion of macro 'scan3'
   65 |         scan3(x,y,z)
      |         ^~~~~
plan.cpp:9:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
plan.cpp:69:5: note: in expansion of macro 'scan1'
   69 |     scan1(m)
      |     ^~~~~
plan.cpp:9:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
plan.cpp:72:9: note: in expansion of macro 'scan1'
   72 |         scan1(x)
      |         ^~~~~
plan.cpp:9:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
plan.cpp:75:5: note: in expansion of macro 'scan1'
   75 |     scan1(m)
      |     ^~~~~
plan.cpp:10:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 | #define scan2(a,b) scanf("%lld %lld",&a, &b);
      |                    ~~~~~^~~~~~~~~~~~~~~~~~~~
plan.cpp:80:13: note: in expansion of macro 'scan2'
   80 |             scan2(x,yy)
      |             ^~~~~
plan.cpp:10:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 | #define scan2(a,b) scanf("%lld %lld",&a, &b);
      |                    ~~~~~^~~~~~~~~~~~~~~~~~~~
plan.cpp:91:13: note: in expansion of macro 'scan2'
   91 |             scan2(x,y)
      |             ^~~~~

• Subtask 1: 10 / 10
• Subtask 2: 13 / 13
• Subtask 3: 0 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 46