oj.uz

답안 #1092686

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1092686 2024-09-24T18:20:03 Z alexander707070 Boat (APIO16_boat) C++14
9 / 100
 2000 ms 331224 KB 
#include<bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#define MAXN 507
using namespace std;

const int mod=1e9+7;

int n,a[MAXN],b[MAXN];
vector<int> pos;
map<int,bool> mp;
map<int,int> where;

int dp[2][1000007];
int pref[2][1000007];

int sum(int id,int from,int to){
    if(from>to)return 0;

    if(from>0)return (pref[id][to]-pref[id][from-1]+mod)%mod;
    return pref[id][to];
}

int main(){

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

        for(int f=a[i];f<=b[i];f++){
            if(mp[f])continue;

            mp[f]=true;
            pos.push_back(f);
        }
    }

    pos.push_back(0);
    sort(pos.begin(),pos.end());

    for(int i=0;i<pos.size();i++)where[pos[i]]=i;

    for(int i=0;i<pos.size();i++){
        pref[0][i]=i+1; dp[0][i]=1;
    }

    for(int i=1;i<=n;i++){
        for(int f=0;f<pos.size();f++){

            dp[i%2][f]=(sum(1-i%2,where[a[i]]-1,min(f,where[b[i]])-1) + dp[1-i%2][f])%mod; 

            pref[i%2][f]=dp[i%2][f];
            if(f>0)pref[i%2][f]+=pref[i%2][f-1];

            pref[i%2][f]%=mod;
        }
    }

    cout<<dp[n%2][pos.size()-1]-1<<"\n";
 
    return 0;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:42:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for(int i=0;i<pos.size();i++)where[pos[i]]=i;
      |                 ~^~~~~~~~~~~
boat.cpp:44:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for(int i=0;i<pos.size();i++){
      |                 ~^~~~~~~~~~~
boat.cpp:49:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         for(int f=0;f<pos.size();f++){
      |                     ~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 5 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 5 ms 536 KB Output is correct
7 Correct 6 ms 540 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 5 ms 352 KB Output is correct
11 Correct 5 ms 352 KB Output is correct
12 Correct 5 ms 540 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
14 Correct 5 ms 352 KB Output is correct
15 Correct 5 ms 352 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 1 ms 352 KB Output is correct
18 Correct 1 ms 352 KB Output is correct
19 Correct 1 ms 496 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 96 ms 1056 KB Output is correct
22 Correct 100 ms 856 KB Output is correct
23 Correct 91 ms 1056 KB Output is correct
24 Correct 95 ms 860 KB Output is correct
25 Correct 96 ms 976 KB Output is correct
26 Correct 66 ms 1040 KB Output is correct
27 Correct 63 ms 876 KB Output is correct
28 Correct 61 ms 864 KB Output is correct
29 Correct 66 ms 856 KB Output is correct
30 Execution timed out 2035 ms 112576 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2076 ms 331224 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 5 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 5 ms 536 KB Output is correct
7 Correct 6 ms 540 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 5 ms 352 KB Output is correct
11 Correct 5 ms 352 KB Output is correct
12 Correct 5 ms 540 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
14 Correct 5 ms 352 KB Output is correct
15 Correct 5 ms 352 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 1 ms 352 KB Output is correct
18 Correct 1 ms 352 KB Output is correct
19 Correct 1 ms 496 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 96 ms 1056 KB Output is correct
22 Correct 100 ms 856 KB Output is correct
23 Correct 91 ms 1056 KB Output is correct
24 Correct 95 ms 860 KB Output is correct
25 Correct 96 ms 976 KB Output is correct
26 Correct 66 ms 1040 KB Output is correct
27 Correct 63 ms 876 KB Output is correct
28 Correct 61 ms 864 KB Output is correct
29 Correct 66 ms 856 KB Output is correct
30 Execution timed out 2035 ms 112576 KB Time limit exceeded
31 Halted 0 ms 0 KB -