oj.uz

답안 #122740

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
122740 2019-06-29T07:53:08 Z popovicirobert Tales of seafaring (POI13_mor) C++14
100 / 100
 2598 ms 117768 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44

/*
const int MOD = ;

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}


inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}
*/

using namespace std;

const int MAXN = 5000;

vector <int> g[MAXN + 1];
short dp[MAXN + 1][MAXN + 1][2];

int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, j, n, m, k;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n >> m >> k;

    for(i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }

    queue < pair <int, int> > Q;

    for(i = 1; i <= n; i++) {
        for(j = 1; j <= n; j++) {
            dp[i][j][0] = dp[i][j][1] = -1;
        }

        Q.push({i, 0});
        dp[i][i][0] = 0;

        while(Q.size()) {
            auto cur = Q.front();
            Q.pop();

            for(auto it : g[cur.first]) {
                if(dp[i][it][cur.second ^ 1] == -1) {
                    dp[i][it][cur.second ^ 1] = dp[i][cur.first][cur.second] + 1;
                    Q.push({it, cur.second ^ 1});
                }
            }
        }
    }

    while(k--) {
        int x, y, d;
        cin >> x >> y >> d;

        if(dp[x][y][d & 1] != -1 && ((dp[x][y][d & 1] < d && g[y].size()) || dp[x][y][d & 1] == d)) {
            cout << "TAK\n";
        }
        else {
            cout << "NIE\n";
        }
    }
    //cin.close();
    //cout.close();
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 335 ms 20332 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 536 KB Output is correct
3 Correct 3 ms 568 KB Output is correct
4 Correct 340 ms 20304 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 3 ms 760 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 2680 KB Output is correct
2 Correct 4 ms 1400 KB Output is correct
3 Correct 24 ms 3448 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 4472 KB Output is correct
2 Correct 16 ms 6392 KB Output is correct
3 Correct 66 ms 6392 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 168 ms 15808 KB Output is correct
2 Correct 19 ms 5752 KB Output is correct
3 Correct 378 ms 24424 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 879 ms 42152 KB Output is correct
2 Correct 41 ms 24312 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1929 ms 96480 KB Output is correct
2 Correct 123 ms 27384 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2107 ms 117768 KB Output is correct
2 Correct 337 ms 101112 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2598 ms 117696 KB Output is correct
2 Correct 579 ms 105080 KB Output is correct