oj.uz

답안 #583620

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583620 2022-06-25T18:45:39 Z AGE Političari (COCI20_politicari) C++14
65 / 70
 60 ms 4192 KB 
#include<bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define int long long
using namespace std;
const int N=1e6,M=2e3,mod=1e9+7;
int a[1000][1000];
map<pair<int,int>,int>viss;
vector<pair<int,int>>v;
pair<int,int>anss;
main()
{
    v.clear();
    anss={0,0};
    viss.clear();

    int n,m;
    cin>>n>>m;

    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            cin>>a[i][j];

    v.pb({0,1});
    v.pb({1,2});

    viss[{0,1}]=1;
    viss[{1,2}]=1;

    while(1){

        int x=v.size()-1;

        if(viss[{v[x].S,a[v[x].S-1][v[x].F-1]}]==1){
            anss.F=v[x].S;
            anss.S=a[v[x].S-1][v[x].F-1];
            break;
        }


        viss[{v[x].S,a[v[x].S-1][v[x].F-1]}]=1;
        v.pb({v[x].S,a[v[x].S-1][v[x].F-1]});

    }

    assert(v.size()>3);
    reverse(v.begin(),v.end());
    while((v.size())&&((*v.rbegin()).F!=anss.F||(*v.rbegin()).S!=anss.S)&&m>0)
        v.pop_back(),m--;


    reverse(v.begin(),v.end());

    int xx=m%v.size();

    if(xx==0)
        xx=v.size();

    xx--;

   // assert(v[xx].S>12);
    cout<<v[xx].S<<endl;

    return 0;
}

Compilation message

politicari.cpp:12:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   12 | main()
      | ^~~~

Subtask #1
65.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 12 ms 1572 KB Output is correct
3 Correct 33 ms 3020 KB Output is correct
4 Correct 41 ms 3636 KB Output is correct
5 Correct 49 ms 4192 KB Output is correct
6 Correct 47 ms 4172 KB Output is correct
7 Incorrect 1 ms 340 KB Output isn't correct
8 Correct 4 ms 980 KB Output is correct
9 Correct 11 ms 1620 KB Output is correct
10 Correct 41 ms 3588 KB Output is correct
11 Correct 49 ms 4104 KB Output is correct
12 Correct 60 ms 4132 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 5 ms 980 KB Output is correct