제출 #636840

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
636840		Tob	Boat (APIO16_boat)	C++14	9 / 100	3 ms	980 KiB

boat

#include <bits/stdc++.h>

#define ll long long
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

ll nxt() {ll num; cin >> num; return num;}

const int N = 507;
const ll mod = 1e9 + 7;

ll n;
ll arr[N];
vector <int> adj[N];
ll dp[N];

ll Mod(ll x) {
	return (x < mod) ? x : x % mod;
}

ll DP(int x) {
	if (dp[x]) return dp[x];
	for (auto it : adj[x]) {
		dp[x] = Mod(dp[x] + DP(it));
	}
	dp[x] = Mod(dp[x]+1);
	return dp[x];
}

int main () {
	cin >> n;
	
	for (int i = 0; i < n; i++) {
		ll a, b; cin >> a >> b;
		arr[i] = a;
	}
	
	arr[n] = 1e18;
	
	for (int i = n; i; i--) {
		for (int j = i-1; j >= 0; j--) {
			if (arr[i] > arr[j]) adj[i].pb(j);
		}
	}
	
	cout << DP(n)-1;
	
	return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 27
• Subtask 4: 0 / 42