Submission #31783

#	Time	Username	Problem	Language	Result	Execution time	Memory
31783		TAMREF	Boat (APIO16_boat)	C++11	9 / 100	0 ms	2180 KiB

boat

#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
int A[505], B[505], n;
bool flag[4];
void init(){
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>A[i]>>B[i];
        if(A[i]!=B[i]) flag[0]=1;
    }
}
void solve0(){
    int D[505];
    memset(D,0,sizeof(D));
    for(int i=0;i<n;i++){
        D[i]=1;
        for(int j=0;j<i;j++){
            if(A[j]<A[i]) D[i]=(D[i]+D[j])%mod;
        }
    }
    int ans=0;
    for(int i=0;i<n;i++) ans=(ans+D[i])%mod;
    cout<<ans<<endl;
}
int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    init();
    if(!flag[0]) solve0();
}

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