oj.uz

Submission #25385

# Submission time Handle Problem Language Result Execution time Memory
25385 2017-06-21T20:26:36 Z gabrielsimoes Jakarta Skyscrapers (APIO15_skyscraper) C++14
0 / 100
 0 ms 2868 KB 
#include <bits/stdc++.h>
using namespace std;

typedef pair<int,int> pii;
typedef long long ll;
const int MAXN = 3e4;
const int INF = 2e9+10;

int N, M;
vector<int> v[MAXN];
bool ok[MAXN];
int dp[MAXN];
// int d[MAXN];

int f(int cur) {
	if (dp[cur] != -1) return dp[cur];

	dp[cur] = INF;
	for (int dx : v[cur]) {
		int i = cur - dx, cnt = 1;
		while (i > 0)
			dp[cur] = min(dp[cur], f(i) + cnt),
			i -= dx, cnt++;
			
		i = cur + dx, cnt = 1;
		while (i < N)
			dp[cur] = min(dp[cur], f(i) + cnt),
			i += dx, cnt++;
	}

	return dp[cur];
}

// int dijkstra() {
// 	for (int i = 0; i < N; i++) d[i] = INF;
// 	d[0] = 0;

// 	int cur = 0;
// 	while (true) {
// 		ok[cur] = true;

// 		for (int dx : v[cur]) {
// 			printf("%d-%d\n",cur,dx);
// 			int i = cur - dx, cnt = 1;
// 			while (i > 0)
// 				d[i] = min(d[i], d[cur] + (cur - i)/dx),
// 				i -= dx, cnt++;

// 			i = cur + dx, cnt = 1;
// 			while (i < N)
// 				d[i] = min(d[i], d[cur] + cnt),
// 				i += dx, cnt++;
// 		}

// 		for (int i = 1; i < N; i++)
// 			if (cur == -1 || d[i] < d[cur])
// 				if (!ok[cur])
// 					cur = i;
// 		if (cur == -1) break;
// 	}

// 	return d[1];
// }

int main()
{
	scanf("%d %d", &N, &M);
	for (int i = 0,a,b; i < M; i++) {
		scanf("%d %d", &a, &b);
		if (b != 0)
			v[a].push_back(b);
	}

	memset(dp, -1, sizeof(dp));
	dp[1] = 0;
	int ans = f(0);
	printf("%d\n", ans < INF ? ans : 0);
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:67:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &M);
                        ^
skyscraper.cpp:69:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &a, &b);
                         ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2868 KB Output is correct
2 Correct 0 ms 2868 KB Output is correct
3 Correct 0 ms 2868 KB Output is correct
4 Incorrect 0 ms 2868 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2868 KB Output is correct
2 Correct 0 ms 2868 KB Output is correct
3 Correct 0 ms 2868 KB Output is correct
4 Incorrect 0 ms 2868 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2868 KB Output is correct
2 Correct 0 ms 2868 KB Output is correct
3 Correct 0 ms 2868 KB Output is correct
4 Incorrect 0 ms 2868 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2868 KB Output is correct
2 Correct 0 ms 2868 KB Output is correct
3 Correct 0 ms 2868 KB Output is correct
4 Incorrect 0 ms 2868 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2868 KB Output is correct
2 Correct 0 ms 2868 KB Output is correct
3 Correct 0 ms 2868 KB Output is correct
4 Incorrect 0 ms 2868 KB Output isn't correct
5 Halted 0 ms 0 KB -