Submission #25902

#	Time	Username	Problem	Language	Result	Execution time	Memory
25902		model_code	새로운 문제 (POI13_mor)	C++11	0 / 100	0 ms	952 KiB

mor

/*************************************************************************
 *                                                                       *
 *                    XX Olimpiada Informatyczna                         *
 *                                                                       *
 *   Zadanie:              Morskie opowiesci                             *
 *   Autor:                Dawid Dabrowski                               *
 *   Zlozonosc czasowa:    O(n^3 + k)                                    *
 *   Zlozonosc pamieciowa: O(n^2)                                        *
 *   Opis:                 Rozwiazanie wolne                             *
 *                         Algorytm Floyda-Warshalla                     *
 *                                                                       *
 *************************************************************************/

#include <cstdio>

#define min(a, b) ((a) < (b) ? (a) : (b))

const int MX = 5000;
const short int INF = 10005;

int n, m, ntc;

short int d[MX][MX][2];
bool isolated[MX];

int main() {
    scanf("%d%d%d", &n, &m, &ntc);
    for (int i = 0; i < n; ++i) for(int j = 0; j < n; ++j)
            d[i][j][0] = d[i][j][1] = INF;
    for (int i = 0; i < n; ++i)
        d[i][i][0] = 0;
    for (int i = 0; i < n; ++i)
        isolated[i] = true;
    for (int i = 0; i < m; ++i) {
        int u, v;
        scanf("%d%d", &u, &v);
        --u;
        --v;
        d[u][v][1] = d[v][u][1] = 1;
        isolated[u] = isolated[v] = false;
    }
    for (int k = 0; k < n; ++k)
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < n; ++j) {
                d[i][j][0] = min(d[i][j][0],
                                 min(d[i][k][0] + d[k][j][0],
                                     d[i][k][1] + d[k][j][1]));
                d[i][j][1] = min(d[i][j][1],
                                 min(d[i][k][1] + d[k][j][0],
                                     d[i][k][0] + d[k][j][1]));
            }
    for (int tc = 0; tc < ntc; ++tc) {
        int u, v, dist;
        scanf("%d%d%d", &u, &v, &dist);
        --u;
        --v;
        if (u == v && isolated[u] && dist > 0) printf("NIE\n");
        else if (d[u][v][dist&1] == INF) printf("NIE\n");
        else printf(d[u][v][dist&1] <= dist ? "TAK\n" : "NIE\n");
    }
    return 0;
}

Compilation message (stderr)

mor.cpp: In function 'int main()':
mor.cpp:27:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &m, &ntc);
                                  ^
mor.cpp:36:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &u, &v);
                              ^
mor.cpp:54:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &u, &v, &dist);
                                       ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10