oj.uz

Submission #1016725

# Submission time Handle Problem Language Result Execution time Memory
1016725 2024-07-08T11:07:37 Z ByeWorld Lasers (NOI19_lasers) C++14
10 / 100
 44 ms 22316 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());

    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){
            lasr = seg[i++].se;
        }
        ANS += lasr-lasl+1;
    }
    cout << ANS << '\n';
}

Compilation message

lasers.cpp: In function 'int main()':
lasers.cpp:58: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]
   58 |     for(int i=0; i<seg.size(); ){
      |                  ~^~~~~~~~~~~
lasers.cpp:60: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]
   60 |         while(i<seg.size() && seg[i].fi <= lasr){
      |               ~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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 14940 KB Output is correct
6 Correct 2 ms 14976 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 2 ms 14952 KB Output is correct
9 Correct 2 ms 14940 KB Output is correct
10 Correct 2 ms 14980 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory 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 14940 KB Output is correct
6 Correct 2 ms 14976 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 2 ms 14952 KB Output is correct
9 Correct 2 ms 14940 KB Output is correct
10 Correct 2 ms 14980 KB Output is correct
11 Incorrect 3 ms 14940 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 44 ms 22316 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 14936 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 44 ms 22316 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory 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 14940 KB Output is correct
6 Correct 2 ms 14976 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 2 ms 14952 KB Output is correct
9 Correct 2 ms 14940 KB Output is correct
10 Correct 2 ms 14980 KB Output is correct
11 Incorrect 3 ms 14940 KB Output isn't correct
12 Halted 0 ms 0 KB -