oj.uz

답안 #722816

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
722816 2023-04-12T23:19:32 Z n0sk1ll Boat (APIO16_boat) C++14
31 / 100
 1852 ms 4276 KB 
#include <bits/stdc++.h>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;







//Note to self: Check for overflow

int a[503],b[503];
int dp[2200006];

int solve3v(int n)
{
    dp[0]=1;
    fff(i,1,n) fff(j,0,i-1) if (a[i]>a[j]) (dp[i]+=dp[j])%=mod;

    int ans=0;
    fff(i,1,n) (ans+=dp[i])%=mod;
    return ans;
}

vector<pair<pii,int>> segs;

int solve(int n)
{
    int shift=0;
    fff(i,1,n) segs.pb({{a[i],b[i]},i});
    sort(all(segs));

    int maxr=0;
    for (auto it : segs)
    {
        if (it.xx.xx-shift>maxr) shift+=(it.xx.xx-shift-(maxr+1));
        a[it.yy]=it.xx.xx-shift,b[it.yy]=it.xx.yy-shift;
        maxr=max(maxr,it.xx.yy-shift);
    }

    dp[0]=1;
    fff(i,1,n)
    {
        int tsum=0;
        fff(s,0,1'000'013)
        {
            (tsum+=dp[s])%=mod;
            if (a[i]<=s && s<=b[i]) dp[s]=tsum;
        }

        //cout<<i<<": "; cout<<"["<<a[i]<<","<<b[i]<<"] --- ";
        //fff(s,0,10) cout<<dp[s]<<" "; cout<<endl;
    }

    int ans=0;
    fff(s,1,1'000'013) (ans+=dp[s])%=mod;
    return ans;
}

int main()
{
    FAST;

    int n; cin>>n;
    fff(i,1,n) cin>>a[i]>>b[i];

    bool radi3v=true;
    fff(i,1,n) if (a[i]!=b[i]) radi3v=false;

    if (radi3v) cout<<solve3v(n)<<"\n";
    else cout<<solve(n)<<"\n";
}

//Note to self: Check for overflow

/*

6
5 9
6 10
7 11
8 12
9 13
10 14

*/

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 284 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1852 ms 376 KB Output is correct
22 Correct 1804 ms 364 KB Output is correct
23 Correct 1779 ms 364 KB Output is correct
24 Correct 1797 ms 356 KB Output is correct
25 Correct 1839 ms 356 KB Output is correct
26 Correct 1823 ms 476 KB Output is correct
27 Correct 1850 ms 360 KB Output is correct
28 Correct 1840 ms 352 KB Output is correct
29 Correct 1823 ms 360 KB Output is correct
30 Correct 1823 ms 4276 KB Output is correct
31 Correct 1830 ms 4224 KB Output is correct
32 Correct 1800 ms 4136 KB Output is correct
33 Correct 1837 ms 4028 KB Output is correct
34 Correct 1836 ms 4124 KB Output is correct
35 Correct 1843 ms 4088 KB Output is correct
36 Correct 1807 ms 4032 KB Output is correct
37 Correct 1807 ms 4028 KB Output is correct
38 Correct 1847 ms 3984 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 382 ms 4164 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 284 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1852 ms 376 KB Output is correct
22 Correct 1804 ms 364 KB Output is correct
23 Correct 1779 ms 364 KB Output is correct
24 Correct 1797 ms 356 KB Output is correct
25 Correct 1839 ms 356 KB Output is correct
26 Correct 1823 ms 476 KB Output is correct
27 Correct 1850 ms 360 KB Output is correct
28 Correct 1840 ms 352 KB Output is correct
29 Correct 1823 ms 360 KB Output is correct
30 Correct 1823 ms 4276 KB Output is correct
31 Correct 1830 ms 4224 KB Output is correct
32 Correct 1800 ms 4136 KB Output is correct
33 Correct 1837 ms 4028 KB Output is correct
34 Correct 1836 ms 4124 KB Output is correct
35 Correct 1843 ms 4088 KB Output is correct
36 Correct 1807 ms 4032 KB Output is correct
37 Correct 1807 ms 4028 KB Output is correct
38 Correct 1847 ms 3984 KB Output is correct
39 Incorrect 382 ms 4164 KB Output isn't correct
40 Halted 0 ms 0 KB -