oj.uz

Submission #1007815

# Submission time Handle Problem Language Result Execution time Memory
1007815 2024-06-25T13:54:34 Z kebine Lasers (NOI19_lasers) C++17
10 / 100
 15 ms 6356 KB 
#include <bits/stdc++.h>
using namespace std; 
#define int long long
#define ld long double
#define fi first 
#define se second 
#define pb push_back
#define pii pair<int,int>
#define piii pair<pair<int,int>,pair<int,int>>
#define pip pair<int,pair<int,int>>

signed main(){
    ios_base::sync_with_stdio(false); 
    cin.tie(NULL); 
    cout.tie(NULL); 
    int ans = 0; 
    int n, q; cin >> n >> q; 
    vector<pair<int,int>>v; 
    for(int i = 1; i <= q; i++){
        int x; cin >> x; 
        int a[x+5]; 
        int tmp = 0; 
        for(int i = 1; i <= x; i++){
            cin >> a[i]; tmp += a[i]; 
        }
        int rem = n - tmp; 
        int cnt = 0; 
        int last = 0; 
        for(int i = 1; i <= x; i++){
            last += a[i]; 
            int val = a[x] - rem; 
            if(val <= 0)continue; 
            v.pb({last-val+1,last}); 
        }
    }
    sort(v.begin(),v.end()); 
    int last = 0; 
    for(int i = 0; i < v.size(); i++){
        if(v[i].fi > last){
            ans += (v[i].se - v[i].fi + 1); 
            last = v[i].se; 
        }
        else{
            ans += (v[i].se - last); 
            last = v[i].se; 
        }
    }
    cout << ans << endl; 
}

Compilation message

lasers.cpp: In function 'int main()':
lasers.cpp:27:13: warning: unused variable 'cnt' [-Wunused-variable]
   27 |         int cnt = 0;
      |             ^~~
lasers.cpp:38:22: 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]
   38 |     for(int i = 0; i < v.size(); i++){
      |                    ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 22.0

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

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -