oj.uz

Submission #47357

# Submission time Handle Problem Language Result Execution time Memory
47357 2018-05-01T07:47:41 Z dqhungdl Sightseeing (NOI14_sightseeing) C++17
15 / 25
 3500 ms 151796 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

typedef pair<int,int> ii;
int n,m,T,d[500005];
vector<ii> g[500005];
priority_queue<ii> Q;

void ReadInt(int &number)
{
    number=0;
    int c=getchar();
    while(c<'0'||c>'9')
        c=getchar();
    for (; ('0'<=c&&c<='9'); c=getchar())
        number=number*10+c-48;
}

void OutPut(int x)
{
    char s[10];
    int i=0;
    do
    {
        s[++i]=x%10+'0';
        x/=10;
    }while(x>0);
    while(i>0)
        putchar(s[i--]);
}

int main()
{
    ios_base::sync_with_stdio(false);
    //freopen("TEST.INP","r",stdin);
    ReadInt(n);
    ReadInt(m);
    ReadInt(T);
    int u,v,w;
    while(m--)
    {
        ReadInt(u);
        ReadInt(v);
        ReadInt(w);
        g[u].push_back(ii(v,w));
        g[v].push_back(ii(u,w));
    }
    d[1]=1e9;
    Q.push(ii(1e9,1));
    while(Q.size()>0)
    {
        int u=Q.top().second;
        int val=Q.top().first;
        Q.pop();
        if(d[u]==val)
            for(int i=0; i<g[u].size(); i++)
            {
                int v=g[u][i].first;
                int w=g[u][i].second;
                if(d[v]<min(d[u],w))
                {
                    d[v]=min(d[u],w);
                    Q.push(ii(d[v],v));
                }
            }
    }
    while(T--)
    {
        ReadInt(u);
        OutPut(d[u]);
        puts("");
    }
}

Compilation message

sightseeing.cpp: In function 'int main()':
sightseeing.cpp:57:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i=0; i<g[u].size(); i++)
                          ~^~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12024 KB Output is correct
2 Correct 13 ms 12132 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12464 KB Output is correct
2 Correct 12 ms 12464 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 14348 KB Output is correct
2 Correct 38 ms 14348 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2935 ms 106184 KB Output is correct
2 Execution timed out 3519 ms 151796 KB Time limit exceeded