Submission #886840

#	Time	Username	Problem	Language	Result	Execution time	Memory
886840		Kutan	Lasers (NOI19_lasers)	C++14	100 / 100	100 ms	33032 KiB

lasers

// 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);
                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 << res << ln;
    }    
};
 
void solve(){       
    subfull::solve();
}
 
int main(){
    sinh_();
    io_faster
    file();
    int t = 1;
//    cin >> t;
    while (t--){
        readip();
        solve();
    }
}

Compilation message (stderr)

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:191: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]
  191 |         for (int i = 1; i < segments.size(); ++i) {
      |                         ~~^~~~~~~~~~~~~~~~~
lasers.cpp:199:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  199 |         for (auto [l, r] : hihi) res += r - l + 1;
      |                   ^
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 / 10
• Subtask 2: 14 / 14
• Subtask 3: 20 / 20
• Subtask 4: 21 / 21
• Subtask 5: 22 / 22
• Subtask 6: 13 / 13