oj.uz

답안 #580760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
580760 2022-06-21T18:26:25 Z Sam_a17 Boat (APIO16_boat) C++14
9 / 100
 998 ms 524288 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#pragma GCC optimize("Ofast")
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
// #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
long long dx[8] = {-1,0,1,0,1,-1,1,-1};
long long dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "" && str != "input") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
}
 
// Random
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
 
// Indexed Set
// template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const long long N = 5e2 + 10, M = 2e6 + 10, mod = 1e9 + 7;
long long l[N], r[N], cnt[M], dp[N][2 * N], pref[N][2 * N];
int n;

void solve_(){
  cin >> n;
 
  vector<long long> vi;
  for(int i = 1; i <= n; i++) {
    cin >> l[i] >> r[i];
    for(int j = l[i]; j <= r[i]; j++) {
      vi.push_back(j);
    }
  }

  sort(all(vi));
  uniq(vi);

  for(int i = 1; i <= n; i++) {
    l[i] = lower_bound(all(vi), l[i]) - vi.begin();
    r[i] = lower_bound(all(vi), r[i]) - vi.begin();
    // [li:ri]
    dbg(l[i]) 
  }

  // dbg("done")
  // dbg(vi)
  int sz = sz(vi);
  long long answ = 0;
  for(int i = 0; i < sz; i++) {
    // dbg(i)
    for(int j = 1; j <= n; j++) {
      if(i > r[j] || i < l[j]) continue;
      // dbg(j)
      dp[j][i] = 1;

      if(i == 0) {        
        pref[j][i] += dp[j][i];
        pref[j][i] %= mod;

        answ += 1, answ %= mod;
        continue;
      }

      for(int k = j - 1; k >= 1; k--) {
        dp[j][i] += pref[k][i - 1];
        dp[j][i] %= mod;
      }

      answ += dp[j][i];
      answ %= mod;

      pref[j][i] += dp[j][i];
      pref[j][i] %= mod;

      // dbg(answ)
    }

    if(i > 0) {
      for(int j = 1; j <= n; j++) {
        pref[j][i] += pref[j][i - 1];
        pref[j][i] %= mod;
      }
    }
  }

  printf("%lld\n", answ);
}
 
int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
  int test_cases = 1;
  solve(test_cases);
 
  return 0;
}

Compilation message

boat.cpp: In function 'void setIO(std::string)':
boat.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boat.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boat.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
boat.cpp:72:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6228 KB Output is correct
2 Correct 8 ms 6292 KB Output is correct
3 Correct 10 ms 6224 KB Output is correct
4 Correct 8 ms 6252 KB Output is correct
5 Correct 9 ms 6228 KB Output is correct
6 Correct 10 ms 6228 KB Output is correct
7 Correct 7 ms 6228 KB Output is correct
8 Correct 7 ms 6228 KB Output is correct
9 Correct 7 ms 6228 KB Output is correct
10 Correct 7 ms 6228 KB Output is correct
11 Correct 8 ms 6228 KB Output is correct
12 Correct 7 ms 6244 KB Output is correct
13 Correct 7 ms 6228 KB Output is correct
14 Correct 7 ms 6248 KB Output is correct
15 Correct 8 ms 6228 KB Output is correct
16 Correct 5 ms 4692 KB Output is correct
17 Correct 6 ms 4692 KB Output is correct
18 Correct 6 ms 4692 KB Output is correct
19 Correct 5 ms 4692 KB Output is correct
20 Correct 6 ms 4648 KB Output is correct

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6228 KB Output is correct
2 Correct 8 ms 6292 KB Output is correct
3 Correct 10 ms 6224 KB Output is correct
4 Correct 8 ms 6252 KB Output is correct
5 Correct 9 ms 6228 KB Output is correct
6 Correct 10 ms 6228 KB Output is correct
7 Correct 7 ms 6228 KB Output is correct
8 Correct 7 ms 6228 KB Output is correct
9 Correct 7 ms 6228 KB Output is correct
10 Correct 7 ms 6228 KB Output is correct
11 Correct 8 ms 6228 KB Output is correct
12 Correct 7 ms 6244 KB Output is correct
13 Correct 7 ms 6228 KB Output is correct
14 Correct 7 ms 6248 KB Output is correct
15 Correct 8 ms 6228 KB Output is correct
16 Correct 5 ms 4692 KB Output is correct
17 Correct 6 ms 4692 KB Output is correct
18 Correct 6 ms 4692 KB Output is correct
19 Correct 5 ms 4692 KB Output is correct
20 Correct 6 ms 4648 KB Output is correct
21 Incorrect 998 ms 15280 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 466 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6228 KB Output is correct
2 Correct 8 ms 6292 KB Output is correct
3 Correct 10 ms 6224 KB Output is correct
4 Correct 8 ms 6252 KB Output is correct
5 Correct 9 ms 6228 KB Output is correct
6 Correct 10 ms 6228 KB Output is correct
7 Correct 7 ms 6228 KB Output is correct
8 Correct 7 ms 6228 KB Output is correct
9 Correct 7 ms 6228 KB Output is correct
10 Correct 7 ms 6228 KB Output is correct
11 Correct 8 ms 6228 KB Output is correct
12 Correct 7 ms 6244 KB Output is correct
13 Correct 7 ms 6228 KB Output is correct
14 Correct 7 ms 6248 KB Output is correct
15 Correct 8 ms 6228 KB Output is correct
16 Correct 5 ms 4692 KB Output is correct
17 Correct 6 ms 4692 KB Output is correct
18 Correct 6 ms 4692 KB Output is correct
19 Correct 5 ms 4692 KB Output is correct
20 Correct 6 ms 4648 KB Output is correct
21 Incorrect 998 ms 15280 KB Output isn't correct
22 Halted 0 ms 0 KB -