| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 949784 | 2024-03-19T17:36:27 Z | Baizho | Boat (APIO16_boat) | C++14 | 2000 ms | 292080 KB |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt,avx")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(5e2)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
//const long double eps = 1e-15L;
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
int add(int x) {
if(x > mod) return x - mod;
return x;
}
int n, a[N], b[N];
map<int, int> dp;
set<int> st;
void Baizho() {
cin>>n;
for(int i = 1; i <= n; i ++) {
cin>>a[i]>>b[i];
int cur = 0;
for(auto x : st) {
if(x >= a[i]) break;
cur = add(cur + dp[x]);
}
dp[a[i]] = add(cur + dp[a[i]] + 1);
st.insert(a[i]);
for(int j = a[i] + 1; j <= b[i]; j ++) {
st.insert(j);
dp[j] = add(dp[j] + dp[j - 1]);
}
}
int sum = 0;
for(auto x : st) sum = add(sum + dp[x]);
cout<<sum;
}
signed main() {
// Freopen("nondec");
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// precalc();
int ttt = 1;
// cin>>ttt;
for(int i=1; i<=ttt; i++) {Baizho(); }
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 348 KB | Output is correct |
| 2 | Correct | 2 ms | 348 KB | Output is correct |
| 3 | Correct | 2 ms | 348 KB | Output is correct |
| 4 | Correct | 2 ms | 348 KB | Output is correct |
| 5 | Correct | 2 ms | 348 KB | Output is correct |
| 6 | Correct | 3 ms | 348 KB | Output is correct |
| 7 | Correct | 3 ms | 344 KB | Output is correct |
| 8 | Correct | 3 ms | 404 KB | Output is correct |
| 9 | Correct | 3 ms | 348 KB | Output is correct |
| 10 | Correct | 3 ms | 500 KB | Output is correct |
| 11 | Correct | 3 ms | 348 KB | Output is correct |
| 12 | Correct | 3 ms | 348 KB | Output is correct |
| 13 | Correct | 3 ms | 344 KB | Output is correct |
| 14 | Correct | 3 ms | 348 KB | Output is correct |
| 15 | Correct | 3 ms | 348 KB | Output is correct |
| 16 | Correct | 1 ms | 348 KB | Output is correct |
| 17 | Correct | 1 ms | 468 KB | Output is correct |
| 18 | Correct | 1 ms | 348 KB | Output is correct |
| 19 | Correct | 1 ms | 468 KB | Output is correct |
| 20 | Correct | 1 ms | 348 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 348 KB | Output is correct |
| 2 | Correct | 2 ms | 348 KB | Output is correct |
| 3 | Correct | 2 ms | 348 KB | Output is correct |
| 4 | Correct | 2 ms | 348 KB | Output is correct |
| 5 | Correct | 2 ms | 348 KB | Output is correct |
| 6 | Correct | 3 ms | 348 KB | Output is correct |
| 7 | Correct | 3 ms | 344 KB | Output is correct |
| 8 | Correct | 3 ms | 404 KB | Output is correct |
| 9 | Correct | 3 ms | 348 KB | Output is correct |
| 10 | Correct | 3 ms | 500 KB | Output is correct |
| 11 | Correct | 3 ms | 348 KB | Output is correct |
| 12 | Correct | 3 ms | 348 KB | Output is correct |
| 13 | Correct | 3 ms | 344 KB | Output is correct |
| 14 | Correct | 3 ms | 348 KB | Output is correct |
| 15 | Correct | 3 ms | 348 KB | Output is correct |
| 16 | Correct | 1 ms | 348 KB | Output is correct |
| 17 | Correct | 1 ms | 468 KB | Output is correct |
| 18 | Correct | 1 ms | 348 KB | Output is correct |
| 19 | Correct | 1 ms | 468 KB | Output is correct |
| 20 | Correct | 1 ms | 348 KB | Output is correct |
| 21 | Correct | 189 ms | 920 KB | Output is correct |
| 22 | Correct | 191 ms | 924 KB | Output is correct |
| 23 | Correct | 182 ms | 860 KB | Output is correct |
| 24 | Correct | 196 ms | 860 KB | Output is correct |
| 25 | Correct | 204 ms | 944 KB | Output is correct |
| 26 | Correct | 188 ms | 728 KB | Output is correct |
| 27 | Correct | 187 ms | 772 KB | Output is correct |
| 28 | Correct | 191 ms | 852 KB | Output is correct |
| 29 | Correct | 185 ms | 788 KB | Output is correct |
| 30 | Execution timed out | 2067 ms | 25488 KB | Time limit exceeded |
| 31 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Execution timed out | 2076 ms | 292080 KB | Time limit exceeded |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 348 KB | Output is correct |
| 2 | Correct | 2 ms | 348 KB | Output is correct |
| 3 | Correct | 2 ms | 348 KB | Output is correct |
| 4 | Correct | 2 ms | 348 KB | Output is correct |
| 5 | Correct | 2 ms | 348 KB | Output is correct |
| 6 | Correct | 3 ms | 348 KB | Output is correct |
| 7 | Correct | 3 ms | 344 KB | Output is correct |
| 8 | Correct | 3 ms | 404 KB | Output is correct |
| 9 | Correct | 3 ms | 348 KB | Output is correct |
| 10 | Correct | 3 ms | 500 KB | Output is correct |
| 11 | Correct | 3 ms | 348 KB | Output is correct |
| 12 | Correct | 3 ms | 348 KB | Output is correct |
| 13 | Correct | 3 ms | 344 KB | Output is correct |
| 14 | Correct | 3 ms | 348 KB | Output is correct |
| 15 | Correct | 3 ms | 348 KB | Output is correct |
| 16 | Correct | 1 ms | 348 KB | Output is correct |
| 17 | Correct | 1 ms | 468 KB | Output is correct |
| 18 | Correct | 1 ms | 348 KB | Output is correct |
| 19 | Correct | 1 ms | 468 KB | Output is correct |
| 20 | Correct | 1 ms | 348 KB | Output is correct |
| 21 | Correct | 189 ms | 920 KB | Output is correct |
| 22 | Correct | 191 ms | 924 KB | Output is correct |
| 23 | Correct | 182 ms | 860 KB | Output is correct |
| 24 | Correct | 196 ms | 860 KB | Output is correct |
| 25 | Correct | 204 ms | 944 KB | Output is correct |
| 26 | Correct | 188 ms | 728 KB | Output is correct |
| 27 | Correct | 187 ms | 772 KB | Output is correct |
| 28 | Correct | 191 ms | 852 KB | Output is correct |
| 29 | Correct | 185 ms | 788 KB | Output is correct |
| 30 | Execution timed out | 2067 ms | 25488 KB | Time limit exceeded |
| 31 | Halted | 0 ms | 0 KB | - |