oj.uz

답안 #1007687

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1007687 2024-06-25T10:20:55 Z christinelynn Lasers (NOI19_lasers) C++17
24 / 100
 129 ms 13376 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
bool ckmin(int& a, int b){return b < a ? a = b, 1 : 0;}
bool ckmax(int& a, int b){return b > a ? a = b, 1 : 0;}
const int N = 2e5 + 5, mod = 1e9 + 7;

signed main(){
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n, q; cin >> n >> q;
    set<pii> st;
    while(q--) {
        int k, s = 0; cin >> k;
        vector<int> v(k);
        int r = n, id = 0;
        for(int i = 0; i < k; i++) {
            cin >> v[i];
            s += v[i];
        }
        int ll = 0, l = n - s + 1;
        int rl = -1, rh = -1;
        for(int i = 0; i < k; i++) {
            ll += v[i];
            if(ll >= l) st.insert({l, ll});
            l += v[i];
        }
    }
    // for(auto i : st) cout << i.fi << " " << i.se << endl;
    int l = -1, r = -1, ans = 0;
    for(auto i : st) {
        if(l == -1) ans += i.se - i.fi + 1, l = i.se + 1;
        else if(i.se >= l) {
            l = max(l + 1, i.fi);
            ans += i.se - l + 1;
            l = i.se + 1;
        }
    }
    cout << ans << endl;
}

Compilation message

lasers.cpp: In function 'int main()':
lasers.cpp:20:13: warning: unused variable 'r' [-Wunused-variable]
   20 |         int r = n, id = 0;
      |             ^
lasers.cpp:20:20: warning: unused variable 'id' [-Wunused-variable]
   20 |         int r = n, id = 0;
      |                    ^~
lasers.cpp:26:13: warning: unused variable 'rl' [-Wunused-variable]
   26 |         int rl = -1, rh = -1;
      |             ^~
lasers.cpp:26:22: warning: unused variable 'rh' [-Wunused-variable]
   26 |         int rl = -1, rh = -1;
      |                      ^~
lasers.cpp:34:17: warning: unused variable 'r' [-Wunused-variable]
   34 |     int l = -1, r = -1, ans = 0;
      |                 ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 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 348 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
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 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 348 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 Correct 0 ms 348 KB Output is correct
12 Correct 55 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 129 ms 13376 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 22.0

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

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 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 348 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 Correct 0 ms 348 KB Output is correct
12 Correct 55 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 129 ms 13376 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Incorrect 38 ms 12156 KB Output isn't correct
22 Halted 0 ms 0 KB -