oj.uz

답안 #826121

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
826121 2023-08-15T10:32:53 Z model_code Inspections (NOI23_inspections) C++17
100 / 100
 988 ms 46992 KB 
#include <bits/stdc++.h>

using namespace std;

#define MAXN 500000
#define MAXM 500000
#define MAXQ 500000

#define DEBUG 0

typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;

struct segment{
    ll left, right;
    ll last_use;

    segment(int _l, int _r, ll _lst){
        left = _l, right = _r, last_use = _lst;
    }

    bool operator<(const segment &other)const{
        return right < other.right;
    }
};

typedef set<segment>::iterator ssi;

set<segment> ranges;

int is_cut(segment cur, segment nex){ 
    // 1 if cur and nex are disjoint
    // 2 if nex is entirely in cur
    // 3 if cur is entirely in nex
    // 4 if nex cuts cur on the left
    // 5 if nex cuts cur on the right
    if (cur.right < nex.left || cur.left > nex.right){
        return 1;
    }
    else if (cur.left <= nex.left && nex.right <= cur.right){
        return 2;
    }
    else if (nex.left <= cur.left && cur.right <= nex.right){
        return 3;
    }
    else if (nex.left <= cur.left && cur.left <= nex.right && nex.right <= cur.right){
        return 4;
    }
    else if (cur.left <= nex.left && nex.left <= cur.right && cur.right <= nex.right){
        return 5;
    }
}

ll N, M, Q;
ll L[MAXM+5], R[MAXM+5];
ll S[MAXQ+5];

map<ll,ll> cnt_dist;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> N >> M >> Q;
    for (int i = 1; i <= M; ++i){
        cin >> L[i] >> R[i];
    }
    for (int i = 1; i <= Q; ++i){
        cin >> S[i];
    }

    vector<pl> v;

    ll tim = 0;

    for (int i = 1; i <= M; ++i){
        
        if (DEBUG){
            cerr << "\nCONSIDERING TASK " << i << "\n";
        }

        segment nex(L[i],R[i],tim);
        vector<segment> cuts;
        vector<segment> ins;
        vector<ssi> del;
        ssi fnd = ranges.lower_bound(segment(L[i],L[i],0));
        while (1){
            if (fnd == ranges.end() || fnd->left > R[i]) break;
            cuts.push_back(*fnd);
            del.push_back(fnd);
            fnd++;
        }

        for (auto it : del){
            if (DEBUG){
                cerr << "DELETING RANGE [" << it->left << "," << it->right << "] WITH TIME " << it->last_use << "\n";
            }
            ranges.erase(it);
        }

        ins.push_back(nex);

        // (nex.last_use - cur.last_use) + (nex.left - cur.left)

        for (auto cur : cuts){
            int cut_dir = is_cut(cur,nex);

            ll time_dist = (nex.last_use - cur.last_use) + (cur.left - nex.left) - 1;
            ll overlap = 0;

            if (cut_dir == 1) continue;
            if (cut_dir == 2){
                ll left_s = cur.left, left_e = nex.left-1, right_s = nex.right+1, right_e = cur.right;
                ll left_time = cur.last_use, right_time = cur.last_use;

                if (left_s <= left_e){
                    ins.push_back(segment(left_s,left_e,left_time));
                }
                if (right_s <= right_e){
                    ins.push_back(segment(right_s,right_e,right_time+right_s-left_s));
                }

                overlap = (nex.right - nex.left + 1);
            }
            if (cut_dir == 3){
                overlap = (cur.right - cur.left + 1);
            }
            if (cut_dir == 4){
                ll right_s = nex.right+1, right_e = cur.right;
                ll right_time = cur.last_use;

                if (right_s <= right_e){
                    ins.push_back(segment(right_s,right_e,right_time+right_s-cur.left));
                }

                overlap = (nex.right - cur.left + 1);
            }
            if (cut_dir == 5){
                ll left_s = cur.left, left_e = nex.left-1;
                ll left_time = cur.last_use;

                if (left_s <= left_e){
                    ins.push_back(segment(left_s,left_e,left_time));
                }

                overlap = (cur.right - nex.left + 1);
            }

            if (cnt_dist.find(time_dist) == cnt_dist.end()){
                cnt_dist[time_dist] = 0;
            }
            cnt_dist[time_dist] += overlap;
        }

        for (auto it : ins){
            if (DEBUG){
                cerr << "INSERTING RANGE [" << it.left << "," << it.right << "] WITH TIME = " << it.last_use << '\n';
            }
            ranges.insert(it);
        } 

        tim += (R[i] - L[i] + 1);
        
    }

    vector<pl> dists, prefdists;
    for (auto it : cnt_dist) dists.push_back(it);
    sort(dists.begin(),dists.end());

    ll sum = 0;
    prefdists.push_back(pl(-1,0));
    for (int i = 0; i < dists.size(); ++i){
        sum += dists[i].second;
        prefdists.push_back(pl(dists[i].first,sum));
        if (DEBUG){
            cerr << "DISTANCE = " << dists[i].first << " , SUM = " << sum << '\n';
        }
    }

    for (int i = 1; i <= Q; ++i){
        cout << sum - (--lower_bound(prefdists.begin(),prefdists.end(),pl(S[i],0)))->second << ' ';
    }
    cout << '\n';


}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:173:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  173 |     for (int i = 0; i < dists.size(); ++i){
      |                     ~~^~~~~~~~~~~~~~
Main.cpp: In function 'int is_cut(segment, segment)':
Main.cpp:53:1: warning: control reaches end of non-void function [-Wreturn-type]
   53 | }
      | ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 39 ms 2768 KB Output is correct
14 Correct 24 ms 2272 KB Output is correct
15 Correct 41 ms 2720 KB Output is correct
16 Correct 35 ms 2888 KB Output is correct
17 Correct 36 ms 2700 KB Output is correct
18 Correct 34 ms 2644 KB Output is correct
19 Correct 39 ms 3228 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 36 ms 2684 KB Output is correct
4 Correct 46 ms 2976 KB Output is correct
5 Correct 570 ms 39008 KB Output is correct
6 Correct 547 ms 38956 KB Output is correct
7 Correct 343 ms 25056 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 39 ms 2768 KB Output is correct
14 Correct 24 ms 2272 KB Output is correct
15 Correct 41 ms 2720 KB Output is correct
16 Correct 35 ms 2888 KB Output is correct
17 Correct 36 ms 2700 KB Output is correct
18 Correct 34 ms 2644 KB Output is correct
19 Correct 39 ms 3228 KB Output is correct
20 Correct 49 ms 4292 KB Output is correct
21 Correct 30 ms 2832 KB Output is correct
22 Correct 39 ms 3984 KB Output is correct
23 Correct 28 ms 3016 KB Output is correct
24 Correct 28 ms 2664 KB Output is correct
25 Correct 34 ms 3060 KB Output is correct
26 Correct 49 ms 4432 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 39 ms 2768 KB Output is correct
14 Correct 24 ms 2272 KB Output is correct
15 Correct 41 ms 2720 KB Output is correct
16 Correct 35 ms 2888 KB Output is correct
17 Correct 36 ms 2700 KB Output is correct
18 Correct 34 ms 2644 KB Output is correct
19 Correct 39 ms 3228 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 36 ms 2684 KB Output is correct
23 Correct 46 ms 2976 KB Output is correct
24 Correct 570 ms 39008 KB Output is correct
25 Correct 547 ms 38956 KB Output is correct
26 Correct 343 ms 25056 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 49 ms 4292 KB Output is correct
30 Correct 30 ms 2832 KB Output is correct
31 Correct 39 ms 3984 KB Output is correct
32 Correct 28 ms 3016 KB Output is correct
33 Correct 28 ms 2664 KB Output is correct
34 Correct 34 ms 3060 KB Output is correct
35 Correct 49 ms 4432 KB Output is correct
36 Correct 619 ms 27348 KB Output is correct
37 Correct 828 ms 46820 KB Output is correct
38 Correct 766 ms 46776 KB Output is correct
39 Correct 125 ms 6248 KB Output is correct
40 Correct 565 ms 42552 KB Output is correct
41 Correct 518 ms 44432 KB Output is correct
42 Correct 513 ms 44928 KB Output is correct
43 Correct 386 ms 41776 KB Output is correct
44 Correct 417 ms 40796 KB Output is correct
45 Correct 871 ms 46992 KB Output is correct
46 Correct 988 ms 43692 KB Output is correct
47 Correct 986 ms 43684 KB Output is correct
48 Correct 708 ms 46708 KB Output is correct