oj.uz

Submission #849192

# Submission time Handle Problem Language Result Execution time Memory
849192 2023-09-14T09:03:23 Z vjudge1 Političari (COCI20_politicari) C++17
10 / 70
 14 ms 4184 KB 
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define int long long
#define pii pair<int,int>
#define piii pair<int, pair<int, int>>
#define v(int) vector<int>
#define si size()
#define foe(i,a,b) for(int i=a;i<=b;++i)
#define fol(i,a,b) for(int i=a;i<b;++i)
#define pb push_back
#define Bit(mask,i) (1<<i)&mask
#define offBit(mask,i) (1<<i)^mask
#define onBit(mask,i) (1<<i)mask
#define CNT(x) __builtin_popcountll(x)
const int mod = 1e9+7;
const int base = 2309;
const int inf = 1e18;
const int N = 1e6+10;
const int LG = 20;
// ▄  ▄ ▄  ▄ ▄  ▄ ▄  ▄ ▄  ▄ ▄▄ ▄ ▄▄▄▄
// █▄▄█ █  █ █  █ █▄▄█ █  █ ██ █ █ ▄▄
// █  █ █▄▄█ █▄▄█ █  █ █▄▄█ █ ██ █▄▄█

int n, k;
int a[510][510];
int dem = 2;
int ans = 2;
v(pii) save;
int dd[510][510];

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> k;
    foe(i,1,n)
    {
        foe(j,1,n)
        {
            cin >> a[i][j];
        }
    }
    if(k == 1)
    {
        cout << 1;
        return 0;
    }
    if(k == 2)
    {
        cout << 2;
        return 0;
    }
    int i = 2;
    int j = 1;
    dd[i][j] = 1;
    while(dem < k)
    {
//        cout << i << " " << j << "\n";
        save.pb({i, j});
        int x = i;
        int y = j;
        i = a[x][y];
        j = x;
        ++ dem;
        if(dd[i][j] == 1)
        {
            break;
        }
        else
            dd[i][j] = 1;
    }
//    cout << "\n";
//    fol(i,0,save.si)
//    {
//        cout << save[i].fi << " " << save[i].se << "\n";
//    }
    k -= 2;
    k %= save.si;
    if(k == 0)
        k = save.si;
    k -= 1;
    ans = a[save[k].fi][save[k].se];
//    cout << k << "      " << ans;
    cout << ans;
    cerr << "\n" << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
    return 0;
}

Subtask #1
10.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 3 ms 3160 KB Output isn't correct
3 Incorrect 8 ms 3932 KB Output isn't correct
4 Incorrect 14 ms 4124 KB Output isn't correct
5 Incorrect 13 ms 4184 KB Output isn't correct
6 Incorrect 13 ms 4184 KB Output isn't correct
7 Correct 1 ms 2392 KB Output is correct
8 Incorrect 1 ms 2904 KB Output isn't correct
9 Incorrect 3 ms 3416 KB Output isn't correct
10 Incorrect 11 ms 4184 KB Output isn't correct
11 Incorrect 13 ms 4184 KB Output isn't correct
12 Incorrect 14 ms 4184 KB Output isn't correct
13 Incorrect 1 ms 2392 KB Output isn't correct
14 Incorrect 1 ms 2904 KB Output isn't correct