oj.uz

답안 #1060861

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1060861 2024-08-16T03:21:42 Z RiverFlow Osumnjičeni (COCI21_osumnjiceni) C++14
30 / 110
 105 ms 106064 KB 
#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maxi(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)2e5 + 9;
const int mod = (int)1e9 + 7;

void prepare(); void main_code();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0; prepare();
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); }
}

void prepare() {};

const int LG = 17;

int p[N], l[N], r[N], lg[N], sp[N][LG + 1];

int get(int l, int r) { int j = lg[r - l + 1];
    return min(sp[l][j], sp[r - (1 << j) + 1][j]);
}

int n;

namespace SUB1 {
    const int N = (int)5e3 + 3;

    int dp[N][N];

    void sol() {
        for(int i = 1; i <= n; ++i) {
            p[i] = n + 1;
            for(int j = i + 1; j <= n; ++j) {
                if ( l[i] > r[j] or r[i] < l[j] ) continue ;
                p[i] = j; break ;
            }
            sp[i][0] = p[i];
        }
        FOR(i, 2, n) lg[i] = lg[i / 2] + 1;
        for(int j = 1; (1 << j) <= n; ++j)
            for(int i = 1; i + (1 << j) - 1 <= n; ++i)
                sp[i][j] = min(sp[i][j - 1], sp[i + (1 << (j - 1))][j - 1]);

        FOD(i, n, 1) {
            int num_seg = 0;
            int last_end = i;
            dp[i][i] = 1;
            for(int j = i + 1; j <= n; ++j) {
                if (get(last_end, j) > j) {
                    dp[i][j] = num_seg + 1;
                    continue ;
                }
                ++num_seg;
                last_end = j;
                dp[i][j] = num_seg + 1;
            }
        }
        int q; cin >> q;
        while (q--) {
            int l, r; cin >> l >> r;
            cout << dp[l][r] << nl;
        }
    }
};

void main_code() {
    cin >> n;
    for(int i = 1; i <= n; ++i) {
        cin >> l[i] >> r[i];
    }
    if (n <= 5000) {
        SUB1::sol();
        return ;
    }

}


/*     Let the river flows naturally     */

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 103172 KB Output is correct
2 Correct 32 ms 97116 KB Output is correct
3 Correct 32 ms 99156 KB Output is correct
4 Correct 43 ms 101196 KB Output is correct
5 Correct 34 ms 96984 KB Output is correct
6 Correct 36 ms 103260 KB Output is correct
7 Correct 36 ms 99236 KB Output is correct
8 Correct 38 ms 103128 KB Output is correct
9 Correct 31 ms 99156 KB Output is correct
10 Correct 32 ms 99152 KB Output is correct
11 Correct 57 ms 103128 KB Output is correct
12 Correct 51 ms 99152 KB Output is correct
13 Correct 52 ms 99156 KB Output is correct
14 Correct 58 ms 103252 KB Output is correct
15 Correct 58 ms 103248 KB Output is correct
16 Correct 1 ms 6488 KB Output is correct
17 Correct 33 ms 101124 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 103172 KB Output is correct
2 Correct 32 ms 97116 KB Output is correct
3 Correct 32 ms 99156 KB Output is correct
4 Correct 43 ms 101196 KB Output is correct
5 Correct 34 ms 96984 KB Output is correct
6 Correct 36 ms 103260 KB Output is correct
7 Correct 36 ms 99236 KB Output is correct
8 Correct 38 ms 103128 KB Output is correct
9 Correct 31 ms 99156 KB Output is correct
10 Correct 32 ms 99152 KB Output is correct
11 Correct 57 ms 103128 KB Output is correct
12 Correct 51 ms 99152 KB Output is correct
13 Correct 52 ms 99156 KB Output is correct
14 Correct 58 ms 103252 KB Output is correct
15 Correct 58 ms 103248 KB Output is correct
16 Correct 1 ms 6488 KB Output is correct
17 Correct 33 ms 101124 KB Output is correct
18 Correct 78 ms 103764 KB Output is correct
19 Correct 70 ms 101636 KB Output is correct
20 Correct 82 ms 106064 KB Output is correct
21 Correct 69 ms 101716 KB Output is correct
22 Correct 65 ms 99724 KB Output is correct
23 Correct 76 ms 103764 KB Output is correct
24 Correct 71 ms 103692 KB Output is correct
25 Correct 69 ms 99668 KB Output is correct
26 Correct 76 ms 105812 KB Output is correct
27 Correct 75 ms 103504 KB Output is correct
28 Correct 85 ms 101208 KB Output is correct
29 Correct 100 ms 101324 KB Output is correct
30 Correct 105 ms 101288 KB Output is correct
31 Correct 86 ms 99272 KB Output is correct
32 Correct 93 ms 105300 KB Output is correct
33 Correct 1 ms 6744 KB Output is correct
34 Correct 57 ms 101460 KB Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 50.0

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