oj.uz

Submission #242764

# Submission time Handle Problem Language Result Execution time Memory
242764 2020-06-29T09:10:41 Z SamAnd Sightseeing (NOI14_sightseeing) C++17
15 / 25
 3500 ms 222736 KB 
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 500005, M = 100005, K = 5000006;

int ka()
{
    int x = 0;
    while (1)
    {
        char y = getchar();
        if ('0' <= y && y <= '9')
            x = (x * 10) + (y - '0');
        else
            return x;
    }
}

char uu[20];
void tp(int x)
{
    if (x == 0)
    {
        putchar('0');
        putchar('\n');
        return;
    }
    int n = 0;
    while (x)
    {
        uu[n++] = (x % 10) + '0';
        x /= 10;
    }
    for (int i = n - 1; i >= 0; --i)
        putchar(uu[i]);
    putchar('\n');
}

int n, m;
vector<int> a[N];
pair<pair<int, int>, int> b[K];

bool c[N];
int ans[N];
int d[N];

stack<int> q[M];

void prr()
{
    for (int x = 1; x <= n; ++x)
        d[x] = -1;
    int j = M - 1;
    q[M - 1].push(1);
    while (1)
    {
        int x;
        do
        {
            if (j == -1)
                return;
            if (q[j].empty())
            {
                --j;
                continue;
            }
            x = q[j].top();
            q[j].pop();
        } while (c[x]);
        c[x] = true;
        ans[x] = j;
        for (int i = 0; i < a[x].size(); ++i)
        {
            int ii = a[x][i];
            int h;
            if (b[ii].fi.fi == x)
                h = b[ii].fi.se;
            else
                h = b[ii].fi.fi;
            int u = min(b[ii].se, j);
            if (!c[h] && u > d[h])
            {
                d[h] = u;
                q[u].push(h);
            }
        }
    }
}

void solv()
{
    int qq;
    n = ka();
    m = ka();
    qq = ka();
    for (int i = 0; i < m; ++i)
    {
        int x, y, z;
        x = ka();
        y = ka();
        z = ka();
        a[x].push_back(i);
        a[y].push_back(i);
        b[i] = m_p(m_p(x, y), z);
    }
    prr();
    while (qq--)
    {
        int x;
        x = ka();
        tp(ans[x]);
    }
}

int main()
{
    #ifdef SOMETHING
    freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    #endif // SOMETHING
    //ios_base::sync_with_stdio(false), cin.tie(0);
    solv();
    return 0;
}

//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}

Compilation message

sightseeing.cpp: In function 'void prr()':
sightseeing.cpp:79:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < a[x].size(); ++i)
                         ~~^~~~~~~~~~~~~
sightseeing.cpp:76:21: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
         } while (c[x]);
                  ~~~^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 79352 KB Output is correct
2 Correct 60 ms 79480 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 79480 KB Output is correct
2 Correct 69 ms 79480 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 81528 KB Output is correct
2 Correct 82 ms 81272 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2830 ms 165748 KB Output is correct
2 Execution timed out 3580 ms 222736 KB Time limit exceeded