oj.uz

답안 #537594

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
537594 2022-03-15T09:26:54 Z MinhAnhnd Sailing Race (CEOI12_race) C++14
10 / 100
 3000 ms 16768 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 parents[401];
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(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(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;
        }
    }
    if (K==1) while(true);
    cout<<maxi<<endl<<mem<<endl;
}

Compilation message

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

Subtask #1
10.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12116 KB Output is correct
2 Execution timed out 3075 ms 12116 KB Time limit exceeded
3 Execution timed out 3078 ms 12244 KB Time limit exceeded
4 Execution timed out 3090 ms 12244 KB Time limit exceeded
5 Incorrect 7 ms 12372 KB Output isn't correct
6 Execution timed out 3082 ms 12452 KB Time limit exceeded
7 Incorrect 9 ms 12500 KB Output isn't correct
8 Execution timed out 3094 ms 12500 KB Time limit exceeded
9 Incorrect 11 ms 12628 KB Output isn't correct
10 Correct 13 ms 12756 KB Output is correct
11 Incorrect 13 ms 12768 KB Output isn't correct
12 Execution timed out 3094 ms 13808 KB Time limit exceeded
13 Execution timed out 3065 ms 14804 KB Time limit exceeded
14 Incorrect 90 ms 15688 KB Output isn't correct
15 Execution timed out 3080 ms 16732 KB Time limit exceeded
16 Execution timed out 3060 ms 16708 KB Time limit exceeded
17 Execution timed out 3096 ms 16640 KB Time limit exceeded
18 Incorrect 148 ms 16732 KB Output isn't correct
19 Execution timed out 3081 ms 16720 KB Time limit exceeded
20 Execution timed out 3075 ms 16768 KB Time limit exceeded