답안 #78562

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
78562 2018-10-06T11:39:43 Z hamzqq9 Sailing Race (CEOI12_race) C++14
0 / 100
695 ms 6548 KB
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<ii,int>
#define iiii pair<ii,ii>
#define sz(x) ((int) x.size())
#define orta ((bas+son)>>1)
#define all(x) x.begin(),x.end()
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define pw(x) (1<<(x))
#define inf 2000000000
#define MOD 1000000007
#define N 505
#define MAX 5000000
#define LOG 100
#define KOK 333
using namespace std;

int n,k,x;
int ar[2*N],a[N][N],dp[2*N][2*N];

void f_1() {

}

void f_0() {

	int ans=-1,tut;

	for(int i=1;i<=n;i++) {

		if(dp[i][i+n-1]>ans) {

			ans=dp[i][i+n-1];
			tut=i;

		}

	}

	printf("%d\n%d\n",ans,tut);

}

void do_1() {

}

void do_0() {

	for(int len=2;len<=n;len++) {

		for(int i=1;i<=2*n;i++) {

			int beg=i-len+1;
			int en=i+len-1;

			if(beg>=1) {

				for(int j=beg;j<i;j++) {

					if(a[ar[i]][ar[j]]) umax(dp[i][beg],max(dp[j][beg],dp[j][i])+1);

				}

			}

			if(en<=2*n) {

				for(int j=i+1;j<=en;j++) {

					if(a[ar[i]][ar[j]]) umax(dp[i][en],max(dp[j][en],dp[j][i])+1);

				}

			}

		}

	}

}

int main() {
	
	//freopen("input.txt","r",stdin);

	scanf("%d %d",&n,&k);

	for(int i=1;i<=n;i++) {

		do {

			scanf("%d",&x);

			if(x==0) break ;

			a[i][x]=1;

		} while(1);

	}

	for(int i=1;i<=n;i++) ar[i]=ar[i+n]=i;

	do_0();
	do_1();

	if(k==0) f_0();
	else f_1();

}

Compilation message

race.cpp: In function 'int main()':
race.cpp:95:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&k);
  ~~~~~^~~~~~~~~~~~~~~
race.cpp:101:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&x);
    ~~~~~^~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 376 KB Output isn't correct
2 Incorrect 3 ms 632 KB Unexpected end of file - int32 expected
3 Incorrect 3 ms 704 KB Unexpected end of file - int32 expected
4 Incorrect 3 ms 880 KB Unexpected end of file - int32 expected
5 Incorrect 4 ms 1120 KB Output isn't correct
6 Incorrect 4 ms 1228 KB Unexpected end of file - int32 expected
7 Incorrect 6 ms 1376 KB Output isn't correct
8 Incorrect 5 ms 1520 KB Unexpected end of file - int32 expected
9 Incorrect 10 ms 1652 KB Output isn't correct
10 Incorrect 9 ms 1808 KB Output isn't correct
11 Incorrect 14 ms 1808 KB Output isn't correct
12 Incorrect 45 ms 2768 KB Unexpected end of file - int32 expected
13 Incorrect 105 ms 3832 KB Unexpected end of file - int32 expected
14 Incorrect 231 ms 4884 KB Output isn't correct
15 Incorrect 503 ms 5980 KB Unexpected end of file - int32 expected
16 Incorrect 611 ms 6056 KB Unexpected end of file - int32 expected
17 Incorrect 525 ms 6196 KB Unexpected end of file - int32 expected
18 Incorrect 339 ms 6316 KB Output isn't correct
19 Incorrect 695 ms 6488 KB Unexpected end of file - int32 expected
20 Incorrect 684 ms 6548 KB Unexpected end of file - int32 expected