oj.uz

답안 #200780

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
200780 2020-02-08T06:44:24 Z Nordway Boat (APIO16_boat) C++14
9 / 100
 6 ms 380 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define up_b upper_bound
#define low_b lower_bound
#define nl '\n'

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;

template<class T,int SZ> struct BIT{
  T t[SZ];
  void upd(int x,T y){
    for(int i=x;i<SZ;i=(i|(i+1))){
      t[i]+=y;
    }
  }
  T pref(int x){
    T res=0;
    for(int i=x;i>=0;i=(i&(i+1))-1){
      res+=t[i];
    }
    return res;
  }
  T get(int l,int r){
    return pref(r)-pref(l-1);
  }
};
template<class T,int SZ> struct ST{
  T t[4*SZ];
  void build(T a[],int v,int tl,int tr){
    if(tl==tr){
      t[v]=a[tl];
      return ;
    }
    int tm=(tl+tr)/2;
    build(a,v*2,tl,tm);
    build(a,v*2+1,tm+1,tr);
    t[v]=t[v*2]+t[v*2+1];
  }
  void upd(int v,int tl,int tr,int pos,T val){
    if(tl==tr){
      t[v]+=val;
      return ;
    }
    int tm=(tl+tr)/2;
    if(pos<=tm)upd(v*2,tl,tm,pos,val);
    else upd(v*2+1,tm+1,tr,pos,val);
    t[v]=t[v*2]+t[v*2+1];
  }
  T get(int v,int tl,int tr,int l,int r){
    if(tl>r||l>tr)return 0;
    if(l<=tl&&tr<=r)return t[v];
    int tm=(tl+tr)/2;
    return get(v*2,tl,tm,l,r)+get(v*2+1,tm+1,tr,l,r);
  }
};

const int N=511;
const int M=1e3+11;
const int W=1e3+11;
const int inf=INT_MAX;
const ll INF=1e18;
const ll mod=1e9+7;
const ld EPS=1e-9;
const int dx[4]={0,0,1,-1};
const int dy[4]={1,-1,0,0};

int a[N],b[N];
ll dp[N];

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0),cout.tie(0);
  int n;
  cin>>n;
  for(int i=1;i<=n;i++){
    cin>>a[i]>>b[i];
  }
  dp[0]=1;
  ll ans=0;
  for(int i=1;i<=n;i++){
    for(int j=0;j<i;j++){
      if(a[i]>a[j]){
        dp[i]+=dp[j];
        dp[i]%=mod;
      }
    }
    ans+=dp[i];
    ans%=mod;
  }
  cout<<ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 380 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 6 ms 380 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Incorrect 5 ms 376 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

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

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 380 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 6 ms 380 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Incorrect 5 ms 376 KB Output isn't correct
22 Halted 0 ms 0 KB -