oj.uz

답안 #1016731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1016731 2024-07-08T11:12:31 Z ByeWorld Lasers (NOI19_lasers) C++14
100 / 100
 270 ms 49220 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 5e5+10;
const int MAXA = 2e3+10;
const int INF = 1e18+10;
const int LOG = 19;
const int MOD = 1e9+7;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
void chmx(int &a, int b){ a = max(a, b); }

int n, num, k[MAXN], tot[MAXN];
vector <int> vec[MAXN];

signed main(){
    // ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> num;
    for(int i=1; i<=num; i++){
        cin >> k[i]; vec[i].pb(-1);
        for(int j=1; j<=k[i]; j++){
            int p; cin >> p; vec[i].pb(p);
            tot[i] += p;
        }
    }
    int ANS = 0; 
    vector <pii> seg;
    for(int i=1; i<=num; i++){
        int L = 1, R = n-tot[i]; // L-R kosong
        // cout << L << ' '<< R << " lr\n";
        for(int j=1; j<=k[i]; j++){
            L += vec[i][j]; 
            if(R+1<=L-1){
                seg.pb({R+1, L-1}); // kena
                // cout << i << ' ' << j << " ij\n";
                // cout << R+1 << ' ' << L-1 << " masuk\n";
            }
            R += vec[i][j];
        }
    }
    sort(seg.begin(), seg.end());
    // for(auto in : seg) cout << in.fi << ' ' << in.se << " ins\n";

    int lasl = 0, lasr = 0;
    for(int i=0; i<seg.size(); ){
        lasl = seg[i].fi; lasr = seg[i].se;
        while(i<seg.size() && seg[i].fi <= lasr){
            chmx(lasr, seg[i++].se);
        }
        ANS += lasr-lasl+1;
    }
    cout << ANS << '\n';
}

Compilation message

lasers.cpp: In function 'int main()':
lasers.cpp:59:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     for(int i=0; i<seg.size(); ){
      |                  ~^~~~~~~~~~~
lasers.cpp:61:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |         while(i<seg.size() && seg[i].fi <= lasr){
      |               ~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 2 ms 14936 KB Output is correct
3 Correct 2 ms 14940 KB Output is correct
4 Correct 2 ms 14940 KB Output is correct
5 Correct 2 ms 14940 KB Output is correct
6 Correct 3 ms 14752 KB Output is correct
7 Correct 3 ms 14936 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 2 ms 14968 KB Output is correct
10 Correct 3 ms 14936 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 2 ms 14936 KB Output is correct
3 Correct 2 ms 14940 KB Output is correct
4 Correct 2 ms 14940 KB Output is correct
5 Correct 2 ms 14940 KB Output is correct
6 Correct 3 ms 14752 KB Output is correct
7 Correct 3 ms 14936 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 2 ms 14968 KB Output is correct
10 Correct 3 ms 14936 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 208 ms 49220 KB Output is correct
13 Correct 3 ms 14940 KB Output is correct
14 Correct 3 ms 14940 KB Output is correct
15 Correct 2 ms 14940 KB Output is correct
16 Correct 2 ms 14940 KB Output is correct
17 Correct 236 ms 46936 KB Output is correct
18 Correct 2 ms 14936 KB Output is correct
19 Correct 2 ms 14936 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 21960 KB Output is correct
2 Correct 18 ms 16396 KB Output is correct
3 Correct 13 ms 16340 KB Output is correct
4 Correct 48 ms 22908 KB Output is correct
5 Correct 22 ms 19412 KB Output is correct
6 Correct 53 ms 21688 KB Output is correct
7 Correct 4 ms 14936 KB Output is correct
8 Correct 52 ms 23632 KB Output is correct
9 Correct 30 ms 22988 KB Output is correct
10 Correct 49 ms 22984 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 2 ms 14940 KB Output is correct
3 Correct 2 ms 14940 KB Output is correct
4 Correct 2 ms 14940 KB Output is correct
5 Correct 2 ms 14972 KB Output is correct
6 Correct 2 ms 14980 KB Output is correct
7 Correct 2 ms 14940 KB Output is correct
8 Correct 2 ms 14940 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 2 ms 14980 KB Output is correct

Subtask #5
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 21960 KB Output is correct
2 Correct 18 ms 16396 KB Output is correct
3 Correct 13 ms 16340 KB Output is correct
4 Correct 48 ms 22908 KB Output is correct
5 Correct 22 ms 19412 KB Output is correct
6 Correct 53 ms 21688 KB Output is correct
7 Correct 4 ms 14936 KB Output is correct
8 Correct 52 ms 23632 KB Output is correct
9 Correct 30 ms 22988 KB Output is correct
10 Correct 49 ms 22984 KB Output is correct
11 Correct 2 ms 14940 KB Output is correct
12 Correct 2 ms 14940 KB Output is correct
13 Correct 2 ms 14940 KB Output is correct
14 Correct 2 ms 14940 KB Output is correct
15 Correct 2 ms 14972 KB Output is correct
16 Correct 2 ms 14980 KB Output is correct
17 Correct 2 ms 14940 KB Output is correct
18 Correct 2 ms 14940 KB Output is correct
19 Correct 3 ms 14940 KB Output is correct
20 Correct 2 ms 14980 KB Output is correct
21 Correct 270 ms 44480 KB Output is correct
22 Correct 48 ms 18124 KB Output is correct
23 Correct 16 ms 17300 KB Output is correct
24 Correct 60 ms 26692 KB Output is correct
25 Correct 195 ms 44480 KB Output is correct
26 Correct 49 ms 25024 KB Output is correct
27 Correct 22 ms 17612 KB Output is correct
28 Correct 192 ms 44016 KB Output is correct
29 Correct 203 ms 44740 KB Output is correct
30 Correct 48 ms 21832 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 2 ms 14936 KB Output is correct
3 Correct 2 ms 14940 KB Output is correct
4 Correct 2 ms 14940 KB Output is correct
5 Correct 2 ms 14940 KB Output is correct
6 Correct 3 ms 14752 KB Output is correct
7 Correct 3 ms 14936 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 2 ms 14968 KB Output is correct
10 Correct 3 ms 14936 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 208 ms 49220 KB Output is correct
13 Correct 3 ms 14940 KB Output is correct
14 Correct 3 ms 14940 KB Output is correct
15 Correct 2 ms 14940 KB Output is correct
16 Correct 2 ms 14940 KB Output is correct
17 Correct 236 ms 46936 KB Output is correct
18 Correct 2 ms 14936 KB Output is correct
19 Correct 2 ms 14936 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 71 ms 21960 KB Output is correct
22 Correct 18 ms 16396 KB Output is correct
23 Correct 13 ms 16340 KB Output is correct
24 Correct 48 ms 22908 KB Output is correct
25 Correct 22 ms 19412 KB Output is correct
26 Correct 53 ms 21688 KB Output is correct
27 Correct 4 ms 14936 KB Output is correct
28 Correct 52 ms 23632 KB Output is correct
29 Correct 30 ms 22988 KB Output is correct
30 Correct 49 ms 22984 KB Output is correct
31 Correct 2 ms 14940 KB Output is correct
32 Correct 2 ms 14940 KB Output is correct
33 Correct 2 ms 14940 KB Output is correct
34 Correct 2 ms 14940 KB Output is correct
35 Correct 2 ms 14972 KB Output is correct
36 Correct 2 ms 14980 KB Output is correct
37 Correct 2 ms 14940 KB Output is correct
38 Correct 2 ms 14940 KB Output is correct
39 Correct 3 ms 14940 KB Output is correct
40 Correct 2 ms 14980 KB Output is correct
41 Correct 270 ms 44480 KB Output is correct
42 Correct 48 ms 18124 KB Output is correct
43 Correct 16 ms 17300 KB Output is correct
44 Correct 60 ms 26692 KB Output is correct
45 Correct 195 ms 44480 KB Output is correct
46 Correct 49 ms 25024 KB Output is correct
47 Correct 22 ms 17612 KB Output is correct
48 Correct 192 ms 44016 KB Output is correct
49 Correct 203 ms 44740 KB Output is correct
50 Correct 48 ms 21832 KB Output is correct
51 Correct 26 ms 17688 KB Output is correct
52 Correct 233 ms 45248 KB Output is correct
53 Correct 211 ms 45768 KB Output is correct
54 Correct 52 ms 20616 KB Output is correct
55 Correct 105 ms 28352 KB Output is correct
56 Correct 60 ms 25800 KB Output is correct
57 Correct 74 ms 26024 KB Output is correct
58 Correct 224 ms 47192 KB Output is correct
59 Correct 49 ms 20944 KB Output is correct
60 Correct 72 ms 23756 KB Output is correct