oj.uz

답안 #79098

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
79098 2018-10-11T04:56:03 Z psmao Sailing Race (CEOI12_race) C++14
40 / 100
 228 ms 3680 KB 
#include <bits/stdc++.h>
using namespace std;

#define fo(i,s,t) for(int i = s; i <= t; ++ i)
#define fd(i,s,t) for(int i = s; i >= t; -- i)
#define bf(i,s) for(int i = head[s]; i; i = e[i].next)
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
#define VI vector<int>
#define sf scanf
#define pf printf
#define fp freopen
#define SZ(x) ((int)(x).size())
#ifdef MPS
#define D(x...) printf(x)
#else
#define D(x...)
#endif
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
const int inf = 1<<30;
const ll INF = 1ll<<60;
const db Inf = 1e20;
const db eps = 1e-9;

void gmax(int &a,int b){a = (a > b ? a : b);}
void gmin(int &a,int b){a = (a < b ? a : b);}

const int maxn = 505;

int f[maxn][maxn], g[maxn][maxn], n, sub;
VI adj[maxn];

int main()
{
	#ifdef MPS
		fp("1.in","r",stdin);
		fp("1.out","w",stdout);
		db mps = clock();
	#endif
	sf("%d%d",&n,&sub);
	fo(i,1,n)
	{
		int x;
		while(1)
		{
			sf("%d",&x);
			if(!x) break;
			adj[i].pb(x);
		}
	}
	fo(len,2,n)
	{
		fo(i,1,n)
		{
			int j = i+len-1;
			if(j > n) j = j - n;
			for(auto k : adj[i])
			{
				if(i < j)
				{
					if(k >= i && k < j) gmax(f[i][j], 1 + max(f[k][j], g[k][i]));
				}
				else
				{
					if(k >= i || k < j) gmax(f[i][j], 1 + max(f[k][j], g[k][i]));
				}
			}
			for(auto k : adj[j])
			{
				if(i < j)
				{
					if(k > i && k <= j) gmax(g[j][i], 1 + max(g[k][i], f[k][j]));
				}
				else
				{
					if(k > i || k <= j) gmax(g[j][i], 1 + max(g[k][i], f[k][j]));
				}
			}	
			// D("%d %d %d %d\n",i,j,f[i][j],g[j][i]);
		}
	}
	int ans = 0, target;
	fo(s,1,n) 
		for(auto t : adj[s])
		{
			if(max(f[t][s], g[t][s]) + 1 > ans)
			{
				ans = max(f[t][s], g[t][s]) + 1;
				target = s;
			}
		}
	pf("%d\n%d\n",ans,target);
	#ifdef MPS
		pf("Time Elapsed: %.3fms\n",clock()-mps);
	#endif
	return 0;
}

Compilation message

race.cpp: In function 'int main()':
race.cpp:45:4: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  sf("%d%d",&n,&sub);
    ^
race.cpp:51:6: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    sf("%d",&x);
      ^

Subtask #1
40.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Incorrect 3 ms 632 KB Output isn't correct
3 Incorrect 3 ms 632 KB Output isn't correct
4 Incorrect 2 ms 632 KB Output isn't correct
5 Correct 3 ms 644 KB Output is correct
6 Incorrect 3 ms 796 KB Output isn't correct
7 Correct 5 ms 800 KB Output is correct
8 Incorrect 3 ms 812 KB Output isn't correct
9 Correct 5 ms 944 KB Output is correct
10 Correct 10 ms 956 KB Output is correct
11 Correct 6 ms 988 KB Output is correct
12 Incorrect 16 ms 1516 KB Output isn't correct
13 Incorrect 32 ms 2004 KB Output isn't correct
14 Correct 74 ms 2436 KB Output is correct
15 Incorrect 148 ms 2988 KB Output isn't correct
16 Incorrect 182 ms 3224 KB Output isn't correct
17 Incorrect 149 ms 3296 KB Output isn't correct
18 Correct 68 ms 3296 KB Output is correct
19 Incorrect 228 ms 3616 KB Output isn't correct
20 Incorrect 220 ms 3680 KB Output isn't correct