oj.uz

답안 #537609

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
537609 2022-03-15T09:41:21 Z MinhAnhnd Sailing Race (CEOI12_race) C++14
40 / 100
 443 ms 16832 KB 
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define ull unsigned ll
using namespace std;


bool branches[501][501]={};
bool chaychua[501][501][2]={};
long N,K;
long dp[501][501][2]={};
vector<long> dp1 [501][501][2] = {};
long depth = -1;

long pre(long p){
    if (p == 1) return N;
    return p-1;
}
long nex(long p){
    if (p == N) return 0;
    return p+1;
}
long memo(long start, long end,long direction){
    if (chaychua[start][end][direction]) return dp[start][end][direction];
    chaychua[start][end][direction] = 1;


    //counter-clockwise;
    if (direction == 0){

    for(long i = nex(start);i != end; i = nex(i)){
        if (branches[start][i]){
            dp[start][end][0] = max(dp[start][end][0],max(memo(i,end,0),memo(start,i,1))+1);
        }
    }

    }
    else{

    for(long i = nex(start);i != end;i = nex(i)){
        if (branches[end][i]){
            dp[start][end][1] = max(dp[start][end][1],max(memo(i,end,0),memo(start,i,1))+1);
        }
    }

    }
    return dp[start][end][direction];
}

int main(){
    cin>>N>>K;
    long v,u=0;

    for(long i = 1;i<=N;i++){
        cin>>v;
        while(v!=0){

            branches[i][v]=1;
            cin>>v;

        }
    }
    long maxi = -1;
    long mem = 0;
    for(long i = 1;i<=N;i++){
        //counter-clockwise
        long val = memo(i,i,0);
        if(val>=maxi){
            maxi = val;
            mem = i;
        }
    }

    cout<<maxi<<endl<<mem<<endl;
}

Compilation message

race.cpp: In function 'int main()':
race.cpp:52:12: warning: unused variable 'u' [-Wunused-variable]
   52 |     long v,u=0;
      |            ^

Subtask #1
40.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12116 KB Output is correct
2 Incorrect 7 ms 12116 KB Output isn't correct
3 Incorrect 6 ms 12260 KB Output isn't correct
4 Incorrect 7 ms 12244 KB Output isn't correct
5 Correct 8 ms 12372 KB Output is correct
6 Incorrect 10 ms 12372 KB Output isn't correct
7 Correct 10 ms 12500 KB Output is correct
8 Incorrect 9 ms 12616 KB Output isn't correct
9 Correct 13 ms 12628 KB Output is correct
10 Correct 13 ms 12756 KB Output is correct
11 Correct 14 ms 12756 KB Output is correct
12 Incorrect 30 ms 13816 KB Output isn't correct
13 Incorrect 56 ms 14876 KB Output isn't correct
14 Correct 99 ms 15804 KB Output is correct
15 Incorrect 369 ms 16732 KB Output isn't correct
16 Incorrect 339 ms 16612 KB Output isn't correct
17 Incorrect 387 ms 16700 KB Output isn't correct
18 Correct 148 ms 16664 KB Output is correct
19 Incorrect 443 ms 16832 KB Output isn't correct
20 Incorrect 439 ms 16732 KB Output isn't correct