제출 #480616

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
480616		Karliver	Boat (APIO16_boat)	C++17	9 / 100	1 ms	344 KiB

boat

    
#include <bits/stdc++.h>

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()

using ll = long long;
int mod = (ll)1e9 + 7;
#define PI acos(-1)
typedef pair<int, int> pairs;

const int INF = 1e9 + 1;
const int N = 2e5 + 100;
const double eps = 1e-7;

template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
    return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
    return (x > y ? x = y, 1 : 0);
}
int A[N], B[N];

void add(ll &x, ll y) {
    x += y;
    if(x >= mod)x -= mod;
}
void solve() {


    int n;
    cin >> n;

    forn(i, n) cin >> A[i] >> B[i];

    V<ll> dp(n, 1);

    for(int i = 1;i < n;++i) {
        for(int j = 0;j < i;++j) {
            if(A[i] > A[j]) {
                add(dp[i], dp[j]);
            }
        }
    }

    ll ret = 0;

    forn(i, n) add(ret, dp[i]);

    cout << ret << '\n';


}
void test_case() {
    int t;
    cin >> t;
    forn(p, t) {

        //cout << "Case #" << p + 1 << ": ";
        solve();
    }
}
int main() {

    ios::sync_with_stdio(false);
    cin.tie(0);

    solve();

}

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