oj.uz

답안 #201242

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201242 2020-02-10T03:09:20 Z smjleo Političari (COCI20_politicari) C++14
0 / 70
 27 ms 2424 KB 
#pragma region cp-helper
#include <bits/stdc++.h>
using namespace std;
#define AC ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define ull unsigned long long
#define ii pair<int, int>
#define lll pair<ll, ll>
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define vll vector<lll>
#define vvl vector<vl>
#define vii vector<ii>
#define all(a) a.begin(), a.end()
#define qsort(a) sort(all(a))
#define qsortd(a) sort(all(a), greater<>())
#define qsortf(a, f) sort(all(a), f)
#define pb(n) push_back(n)
#define eb(n) emplace_back(n)
#define pp(a, b) emplace_back(a, b)
#define umap unordered_map
#define uset unordered_set
#define nl '\n'
#define fileio(in, out) freopen(in, "r", stdin); freopen(out, "w", stdout)
#define qmod %mod
#define pls int
#define give main()
const int mod = 1000000007;
#pragma endregion

const int N = 5*1e2+5;

ll n, k, g[N][N], offset;
vi ans = {1};
map<lll, ll> m;

void dfs(ll prev, ll node, ll index) {
    if (m.find({prev, node}) != m.end()) {
        offset = m[{prev, node}];
        return;
    }
    m[{prev, node}] = index;
    ans.pb(node);
    dfs(node, g[node][prev], index+1);
}

pls give {
    AC;
    cin >> n >> k;
    for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) cin >> g[i][j];
    for (int i=1; i<=n; i++) {
        if (g[1][i] == 2) m[{i, 1}] = 0;
    }
    dfs(1, 2, 1);
    cout << ans[((k-1) % (ans.size()-offset)) + offset] << nl;
}

Compilation message

politicari.cpp:1:0: warning: ignoring #pragma region cp [-Wunknown-pragmas]
 #pragma region cp-helper
 
politicari.cpp:30:0: warning: ignoring #pragma endregion  [-Wunknown-pragmas]
 #pragma endregion

Subtask #1
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 376 KB Output isn't correct
2 Incorrect 9 ms 1272 KB Output isn't correct
3 Incorrect 17 ms 1912 KB Output isn't correct
4 Incorrect 20 ms 2168 KB Output isn't correct
5 Incorrect 22 ms 2296 KB Output isn't correct
6 Incorrect 27 ms 2424 KB Output isn't correct
7 Incorrect 5 ms 376 KB Output isn't correct
8 Incorrect 6 ms 760 KB Output isn't correct
9 Incorrect 9 ms 1272 KB Output isn't correct
10 Incorrect 21 ms 2168 KB Output isn't correct
11 Incorrect 23 ms 2300 KB Output isn't correct
12 Incorrect 24 ms 2296 KB Output isn't correct
13 Incorrect 5 ms 504 KB Output isn't correct
14 Incorrect 8 ms 888 KB Output isn't correct