제출 #947264

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
947264		NValchanov	Boat (APIO16_boat)	C++17	9 / 100	286 ms	524288 KiB

boat

#include<bits/stdc++.h>

#define endl '\n'
#define a first
#define b second

using namespace std;

typedef long long ll;

const ll MAXN = 512;
const ll MAXA = 1e6 + 10;
const ll MOD = 1e9 + 7;

ll n,cnt;
pair<ll,ll> s[MAXN];
ll dp[MAXN];
ll pref[MAXN];
unordered_map <ll,ll> pos;

void read()
{
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> s[i].a >> s[i].b;
    }
    s[0].a = s[0].b = 0;
}

void fill_pos()
{
    vector <ll> v;

    for(int i = 1; i <= n; i++)
    {
        for(int j = s[i].a; j <= s[i].b; j++)
        {
            v.push_back(j);
        }
    }
    sort(v.begin(), v.end());

    ll last = -1;
    ll sz = v.size();

    for(int i = 0; i < sz; i++)
    {
        ll cur = v[i];
        if(cur == last)
            continue;

        pos[cur] = ++cnt;
        last = cur;
    }
    /**
    for(auto x : pos)
    {
        cout << x.first << " " << x.second << endl;
    }
    */
}

void fill_dp()
{
    for(int i = 1; i <= n; i++)
    {
        ll from = pos[s[i].a];
        ll to = pos[s[i].b];
        for(int j = to; j >= from; j--)
        {
            dp[j] = (dp[j] + pref[j - 1] + 1 /** za nulata **/) % MOD;
        }
        for(int j = from; j <= cnt; j++)
        {
            pref[j] = (pref[j - 1] + dp[j]) % MOD;
        }
    }
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

    read();
    fill_pos();
    fill_dp();

    cout << pref[cnt] << endl;

	return 0;
}

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