oj.uz

답안 #947277

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947277 2024-03-15T20:46:15 Z NValchanov Boat (APIO16_boat) C++17
31 / 100
 1916 ms 524288 KB 
#include<bits/stdc++.h>

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

using namespace std;

typedef long long ll;

const int MAXN = 500 + 10;
const int MAXA = 1e6 + 10;
const int MOD = 1e9 + 7;

int n,cnt;
int a[MAXN];
int b[MAXN];
int dp[MAXA];
int pref[MAXA];
unordered_map <int,int> pos;

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

void fill_pos()
{
    vector <int> v;
    set <int> st;

    for(int i = 1; i <= n; i++)
    {
        int from = a[i];
        int to = b[i];

        for(int j = from; j <= to; j++)
        {
            v.push_back(j);
        }
    }
    sort(v.begin(), v.end());

    ll last = -1;

    for(int cur : v)
    {
        if(cur == last)
            continue;

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

void fill_dp()
{
    for(int i = 1; i <= n; i++)
    {
        int from = pos[a[i]];
        int to = pos[b[i]];
        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.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 42 ms 6100 KB Output is correct
22 Correct 43 ms 6352 KB Output is correct
23 Correct 40 ms 5332 KB Output is correct
24 Correct 42 ms 6608 KB Output is correct
25 Correct 44 ms 5328 KB Output is correct
26 Correct 43 ms 6100 KB Output is correct
27 Correct 46 ms 6100 KB Output is correct
28 Correct 42 ms 5328 KB Output is correct
29 Correct 43 ms 6608 KB Output is correct
30 Correct 1916 ms 50400 KB Output is correct
31 Correct 1882 ms 49772 KB Output is correct
32 Correct 1901 ms 50488 KB Output is correct
33 Correct 1827 ms 49368 KB Output is correct
34 Correct 1871 ms 49912 KB Output is correct
35 Correct 1777 ms 48348 KB Output is correct
36 Correct 1865 ms 49284 KB Output is correct
37 Correct 1839 ms 50144 KB Output is correct
38 Correct 1778 ms 48812 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 442 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 42 ms 6100 KB Output is correct
22 Correct 43 ms 6352 KB Output is correct
23 Correct 40 ms 5332 KB Output is correct
24 Correct 42 ms 6608 KB Output is correct
25 Correct 44 ms 5328 KB Output is correct
26 Correct 43 ms 6100 KB Output is correct
27 Correct 46 ms 6100 KB Output is correct
28 Correct 42 ms 5328 KB Output is correct
29 Correct 43 ms 6608 KB Output is correct
30 Correct 1916 ms 50400 KB Output is correct
31 Correct 1882 ms 49772 KB Output is correct
32 Correct 1901 ms 50488 KB Output is correct
33 Correct 1827 ms 49368 KB Output is correct
34 Correct 1871 ms 49912 KB Output is correct
35 Correct 1777 ms 48348 KB Output is correct
36 Correct 1865 ms 49284 KB Output is correct
37 Correct 1839 ms 50144 KB Output is correct
38 Correct 1778 ms 48812 KB Output is correct
39 Runtime error 442 ms 524288 KB Execution killed with signal 9
40 Halted 0 ms 0 KB -