oj.uz

답안 #924099

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
924099 2024-02-08T12:56:39 Z pcc Journey (NOI18_journey) C++14
100 / 100
 57 ms 40008 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>


const int mxn = 1e4+10;
const int mxm = 410;
const ll inf = 5e8+1;
ll cnt[mxn][mxm];
ll dist[mxn];
vector<pii> paths[mxn],rg[mxn];
int n,m,h;

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>m>>h;
	for(int i = 0;i<n-1;i++){
		for(int j = 0;j<h;j++){
			int a,b;
			cin>>a>>b;
			paths[i].push_back({a,b});
			rg[i].push_back({a,b});
		}
	}
	cnt[0][0] = 1;
	for(int i = 0;i<n;i++){
		for(auto nxt:paths[i]){
			if(nxt.fs<=i)continue;
			ll pre = 0;
			for(int j = 0;j+nxt.sc<m;j++){
				pre = min(pre+cnt[i][j],inf);
				cnt[nxt.fs][j+nxt.sc] = min(cnt[nxt.fs][j+nxt.sc]+pre,inf);
			}
		}
	}
	for(int i = 0;i<m;i++)cout<<cnt[n-1][i]<<' ';
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 1 ms 2764 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 1 ms 2764 KB Output is correct
7 Correct 48 ms 40008 KB Output is correct
8 Correct 36 ms 25424 KB Output is correct
9 Correct 10 ms 5464 KB Output is correct
10 Correct 57 ms 6748 KB Output is correct