oj.uz

Submission #886839

# Submission time Handle Problem Language Result Execution time Memory
886839 2023-12-13T03:33:13 Z Kutan Lasers (NOI19_lasers) C++14
100 / 100
 102 ms 33480 KB 
// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
 
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));
 
const int INF = 1e9 , mod = 1e9 + 7;
 
template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }
 
template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}
 
template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }
 
template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }
 
template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }
 
template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }
 
#define PROB "a"
void file(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp","r",stdin);
        freopen(PROB".out","w",stdout);
    }
}
void sinh_(){
//    srand(time(0));
//    freopen(PROB".inp" , "w" , stdout);
//    int n;
}
 
typedef long long ll;
typedef double db;
const int N = 5e5 + 5;
int L, R;
vector<int> length[N];
void readip(){
    cin >> L >> R;
    REP(i, 1, R) {
        int x; cin >> x;
        length[i].assign(x, 0);
        for (auto &val : length[i])
            cin >> val;
    }
}
 
namespace sub12{
    bool check() {
        REP(i, 1, R) if (length[i].size() > 1)
            return false;
        return true;
    }
 
    void solve() {
        int MaxLength = 0;
        REP(i, 1, R) maximize(MaxLength, length[i][0]);
        if (L - MaxLength > MaxLength) cout << 0 << ln;
        else cout << MaxLength - (L - MaxLength) << ln;
    }
};
 
namespace subfull{
    void solve() {
        vpii segments;
        REP(i, 1, R) {
            int sum = 0;
            for (int l : length[i])  sum += l;
 
            int sumlef = 0;
            for (int l : length[i]) {
                int sumrig = sum - sumlef - l;
                int s = sumlef, e = L - sumrig;
                if (e - l + 1 <= s + l) { 
                    segments.eb(e - l + 1, s + l);
                    // cout << i << ' ' << e - l + 1 << ' ' << s + l << ln; 
                    // cout << i << ' ' << l << ' ' << s << ' ' << e << ' ' <<  e - l << ' ' << s + l << ln;
                }
                sumlef += l;
            }
        }
        sort(ALL(segments));
 
        if (segments.empty()) {
            cout << 0 << ln;
            return;
        }
 
        vpii hihi;
        hihi.eb(segments[0]);
        for (int i = 1; i < segments.size(); ++i) {
            int l = segments[i].first, r = segments[i].second;
            if (r <= hihi.back().second) continue;
 
            if (l <= hihi.back().second) hihi.back().second = r;
            else hihi.eb(l, r);
        }
        int res = 0;
        for (auto [l, r] : hihi) {
            res += r - l + 1;
            // cout << l << ' ' << r << ln;
        }
        cout << res;
    }    
};
 
void solve(){       
    subfull::solve();
}
 
int main(){
    sinh_();
    io_faster
    file();
    int t = 1;
//    cin >> t;
    while (t--){
        readip();
        solve();
    }
}

Compilation message

lasers.cpp: In function 'void readip()':
lasers.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
lasers.cpp:142:5: note: in expansion of macro 'REP'
  142 |     REP(i, 1, R) {
      |     ^~~
lasers.cpp: In function 'bool sub12::check()':
lasers.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
lasers.cpp:152:9: note: in expansion of macro 'REP'
  152 |         REP(i, 1, R) if (length[i].size() > 1)
      |         ^~~
lasers.cpp: In function 'void sub12::solve()':
lasers.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
lasers.cpp:159:9: note: in expansion of macro 'REP'
  159 |         REP(i, 1, R) maximize(MaxLength, length[i][0]);
      |         ^~~
lasers.cpp: In function 'void subfull::solve()':
lasers.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
lasers.cpp:168:9: note: in expansion of macro 'REP'
  168 |         REP(i, 1, R) {
      |         ^~~
lasers.cpp:193:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  193 |         for (int i = 1; i < segments.size(); ++i) {
      |                         ~~^~~~~~~~~~~~~~~~~
lasers.cpp:201:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  201 |         for (auto [l, r] : hihi) {
      |                   ^
lasers.cpp: In function 'void file()':
lasers.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen(PROB".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
lasers.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(PROB".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12120 KB Output is correct
2 Correct 4 ms 12120 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 3 ms 12124 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 3 ms 12120 KB Output is correct
8 Correct 4 ms 12124 KB Output is correct
9 Correct 3 ms 12124 KB Output is correct
10 Correct 3 ms 12124 KB Output is correct
11 Correct 3 ms 12124 KB Output is correct
12 Correct 86 ms 33480 KB Output is correct
13 Correct 3 ms 12124 KB Output is correct
14 Correct 3 ms 12124 KB Output is correct
15 Correct 3 ms 12124 KB Output is correct
16 Correct 3 ms 12148 KB Output is correct
17 Correct 95 ms 29948 KB Output is correct
18 Correct 3 ms 12124 KB Output is correct
19 Correct 3 ms 12168 KB Output is correct
20 Correct 3 ms 12124 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 16340 KB Output is correct
2 Correct 8 ms 12712 KB Output is correct
3 Correct 8 ms 12820 KB Output is correct
4 Correct 31 ms 16584 KB Output is correct
5 Correct 15 ms 13780 KB Output is correct
6 Correct 23 ms 14812 KB Output is correct
7 Correct 4 ms 12124 KB Output is correct
8 Correct 25 ms 15160 KB Output is correct
9 Correct 17 ms 15060 KB Output is correct
10 Correct 31 ms 16940 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12120 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 3 ms 12124 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 5 ms 12124 KB Output is correct
8 Correct 3 ms 12124 KB Output is correct
9 Correct 3 ms 12308 KB Output is correct
10 Correct 3 ms 12124 KB Output is correct

Subtask #5
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 16340 KB Output is correct
2 Correct 8 ms 12712 KB Output is correct
3 Correct 8 ms 12820 KB Output is correct
4 Correct 31 ms 16584 KB Output is correct
5 Correct 15 ms 13780 KB Output is correct
6 Correct 23 ms 14812 KB Output is correct
7 Correct 4 ms 12124 KB Output is correct
8 Correct 25 ms 15160 KB Output is correct
9 Correct 17 ms 15060 KB Output is correct
10 Correct 31 ms 16940 KB Output is correct
11 Correct 3 ms 12120 KB Output is correct
12 Correct 3 ms 12124 KB Output is correct
13 Correct 3 ms 12124 KB Output is correct
14 Correct 3 ms 12124 KB Output is correct
15 Correct 3 ms 12124 KB Output is correct
16 Correct 3 ms 12124 KB Output is correct
17 Correct 5 ms 12124 KB Output is correct
18 Correct 3 ms 12124 KB Output is correct
19 Correct 3 ms 12308 KB Output is correct
20 Correct 3 ms 12124 KB Output is correct
21 Correct 102 ms 29936 KB Output is correct
22 Correct 17 ms 13276 KB Output is correct
23 Correct 9 ms 13016 KB Output is correct
24 Correct 31 ms 16080 KB Output is correct
25 Correct 93 ms 29644 KB Output is correct
26 Correct 27 ms 15316 KB Output is correct
27 Correct 12 ms 13276 KB Output is correct
28 Correct 98 ms 29828 KB Output is correct
29 Correct 93 ms 29804 KB Output is correct
30 Correct 24 ms 14552 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12120 KB Output is correct
2 Correct 4 ms 12120 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 3 ms 12124 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 3 ms 12120 KB Output is correct
8 Correct 4 ms 12124 KB Output is correct
9 Correct 3 ms 12124 KB Output is correct
10 Correct 3 ms 12124 KB Output is correct
11 Correct 3 ms 12124 KB Output is correct
12 Correct 86 ms 33480 KB Output is correct
13 Correct 3 ms 12124 KB Output is correct
14 Correct 3 ms 12124 KB Output is correct
15 Correct 3 ms 12124 KB Output is correct
16 Correct 3 ms 12148 KB Output is correct
17 Correct 95 ms 29948 KB Output is correct
18 Correct 3 ms 12124 KB Output is correct
19 Correct 3 ms 12168 KB Output is correct
20 Correct 3 ms 12124 KB Output is correct
21 Correct 28 ms 16340 KB Output is correct
22 Correct 8 ms 12712 KB Output is correct
23 Correct 8 ms 12820 KB Output is correct
24 Correct 31 ms 16584 KB Output is correct
25 Correct 15 ms 13780 KB Output is correct
26 Correct 23 ms 14812 KB Output is correct
27 Correct 4 ms 12124 KB Output is correct
28 Correct 25 ms 15160 KB Output is correct
29 Correct 17 ms 15060 KB Output is correct
30 Correct 31 ms 16940 KB Output is correct
31 Correct 3 ms 12120 KB Output is correct
32 Correct 3 ms 12124 KB Output is correct
33 Correct 3 ms 12124 KB Output is correct
34 Correct 3 ms 12124 KB Output is correct
35 Correct 3 ms 12124 KB Output is correct
36 Correct 3 ms 12124 KB Output is correct
37 Correct 5 ms 12124 KB Output is correct
38 Correct 3 ms 12124 KB Output is correct
39 Correct 3 ms 12308 KB Output is correct
40 Correct 3 ms 12124 KB Output is correct
41 Correct 102 ms 29936 KB Output is correct
42 Correct 17 ms 13276 KB Output is correct
43 Correct 9 ms 13016 KB Output is correct
44 Correct 31 ms 16080 KB Output is correct
45 Correct 93 ms 29644 KB Output is correct
46 Correct 27 ms 15316 KB Output is correct
47 Correct 12 ms 13276 KB Output is correct
48 Correct 98 ms 29828 KB Output is correct
49 Correct 93 ms 29804 KB Output is correct
50 Correct 24 ms 14552 KB Output is correct
51 Correct 14 ms 13156 KB Output is correct
52 Correct 98 ms 29640 KB Output is correct
53 Correct 99 ms 29600 KB Output is correct
54 Correct 22 ms 13996 KB Output is correct
55 Correct 47 ms 16080 KB Output is correct
56 Correct 28 ms 15560 KB Output is correct
57 Correct 33 ms 15308 KB Output is correct
58 Correct 99 ms 29904 KB Output is correct
59 Correct 24 ms 14064 KB Output is correct
60 Correct 33 ms 14460 KB Output is correct