oj.uz

답안 #580675

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
580675 2022-06-21T15:31:30 Z Sam_a17 Boat (APIO16_boat) C++14
9 / 100
 2000 ms 524288 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;

#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 blt __builtin_popcount

#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, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
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 << "]";}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'

// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int 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 != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// 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, mod = 1e9 + 7;
long long n, dp[N];
long long li[N], ri[N];

void solve_() {
  cin >> n;

  vector<vector<long long>> dp, pref;
  dp.push_back({});
  pref.push_back({});
  for(int i = 1; i <= n; i++) {
    cin >> li[i] >> ri[i];

    vector<long long> vi(ri[i] - li[i] + 1, 0);
    dbg(vi)
    pref.push_back(vi);
    dp.push_back(vi);
  }

  long long answ = 0;
  for(int i = 1; i <= n; i++) {
    int cnt = ri[i] - li[i] + 1;
    for(int j = 0; j < cnt; j++) {
      dp[i][j] = 1;
    }

    for(int j = 0; j < cnt; j++) {
      long long curr = li[i] + j;
      for(int k = i - 1; k >= 1; k--) {
        if(li[k] >= curr) continue;
        long long x = min(curr - 1, ri[k]) - li[k];
        dp[i][j] += pref[k][x];
      }
    }
    for(int j = 0; j < cnt; j++) {
      answ += dp[i][j];
      if(j) {
        pref[i][j] = pref[i][j - 1] + dp[i][j];
      } else {
        pref[i][j] = dp[i][j];
      }
      
      pref[i][j] %= mod;
      answ %= 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:63:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boat.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 7 ms 340 KB Output is correct
3 Correct 7 ms 388 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 7 ms 340 KB Output is correct
12 Correct 6 ms 356 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 6 ms 340 KB Output is correct
15 Correct 7 ms 340 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 5 ms 340 KB Output is correct
19 Correct 5 ms 340 KB Output is correct
20 Correct 6 ms 340 KB Output is correct
21 Execution timed out 2095 ms 15764 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

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

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 7 ms 340 KB Output is correct
3 Correct 7 ms 388 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 7 ms 340 KB Output is correct
12 Correct 6 ms 356 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 6 ms 340 KB Output is correct
15 Correct 7 ms 340 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 5 ms 340 KB Output is correct
19 Correct 5 ms 340 KB Output is correct
20 Correct 6 ms 340 KB Output is correct
21 Execution timed out 2095 ms 15764 KB Time limit exceeded
22 Halted 0 ms 0 KB -