Submission #242468

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
242468	2020-06-27T18:50:53 Z	AmineWeslati	Lasers (NOI19_lasers)	C++14	100 / 100	219 ms	10048 KB

lasers

//Never stop trying
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()

using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
//#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0}; //right left down up

int main(){
   boost;
	int L,R;cin>>L>>R;
	vpi vec;

	while(R--){
      int N; cin>>N; if(N==0) continue;
      int t[N]; vpi v;
      int l=0,r=0,ll=L+1,rr;
      for(int i=0; i<N; i++){
         cin>>t[i];
         r+=t[i];
      }
      if(r==L){
         vec.pb({1,L}); continue;
      }
      v.pb({r+1,L});

      int idx=N-1;
      while(idx>=0){
         r-=t[idx]; ll-=t[idx];
         v.pb({r+1,ll-1});
         idx--;
      }
      v.pb({L+1,L+1});


      /*for(auto x: v) cout << x.fi << ' '<<x.se << endl;
      cout << endl;*/
      sort(all(v));



      l=v[0].fi,r=v[0].se;
      for(int i=1; i<sz(v); i++){
         ll=v[i].fi,rr=v[i].se;
         //cout << l << ' '<< r << endl;
         if(!(ll>r+1||l>rr+1)){
            l=min(l,ll); r=max(r,rr);
         }
         else{
            vec.pb({r+1,ll-1});
            l=ll; r=rr;
         }
      }

      /*for(auto x: vec) cout << x.fi << ' '<<x.se << endl;
      cout << endl;*/

	}

   sort(all(vec));
   /*for(auto x: vec) cout << x.fi << ' '<<x.se << endl;
   cout << endl;*/
   if(vec.empty()){
      cout << 0 << endl;
      return 0;
   }
	int res=0;
	int l=vec[0].fi,r=vec[0].se;
	for(int i=1; i<sz(vec); i++){
	   int ll=vec[i].fi,rr=vec[i].se;
      if(!(ll>r||l>rr)){
         l=min(l,ll); r=max(r,rr);
      }
      else{
         res+=r-l+1;
         l=ll,r=rr;
      }
	}
	res+=r-l+1;
	cout << res << endl;

   return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	4 ms	256 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	133 ms	10048 KB	Output is correct
13	Correct	4 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	208 ms	7864 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	75 ms	7176 KB	Output is correct
2	Correct	17 ms	1788 KB	Output is correct
3	Correct	24 ms	1632 KB	Output is correct
4	Correct	75 ms	6644 KB	Output is correct
5	Correct	37 ms	3484 KB	Output is correct
6	Correct	79 ms	6764 KB	Output is correct
7	Correct	5 ms	512 KB	Output is correct
8	Correct	91 ms	8984 KB	Output is correct
9	Correct	40 ms	4204 KB	Output is correct
10	Correct	80 ms	8148 KB	Output is correct

Subtask #4
21.0 / 21.0

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

Subtask #5
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	75 ms	7176 KB	Output is correct
2	Correct	17 ms	1788 KB	Output is correct
3	Correct	24 ms	1632 KB	Output is correct
4	Correct	75 ms	6644 KB	Output is correct
5	Correct	37 ms	3484 KB	Output is correct
6	Correct	79 ms	6764 KB	Output is correct
7	Correct	5 ms	512 KB	Output is correct
8	Correct	91 ms	8984 KB	Output is correct
9	Correct	40 ms	4204 KB	Output is correct
10	Correct	80 ms	8148 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	203 ms	6764 KB	Output is correct
22	Correct	30 ms	1536 KB	Output is correct
23	Correct	23 ms	1736 KB	Output is correct
24	Correct	92 ms	5944 KB	Output is correct
25	Correct	206 ms	6636 KB	Output is correct
26	Correct	61 ms	3796 KB	Output is correct
27	Correct	28 ms	1532 KB	Output is correct
28	Correct	205 ms	6632 KB	Output is correct
29	Correct	207 ms	6760 KB	Output is correct
30	Correct	73 ms	3664 KB	Output is correct

Subtask #6
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	4 ms	256 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	133 ms	10048 KB	Output is correct
13	Correct	4 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	208 ms	7864 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	75 ms	7176 KB	Output is correct
22	Correct	17 ms	1788 KB	Output is correct
23	Correct	24 ms	1632 KB	Output is correct
24	Correct	75 ms	6644 KB	Output is correct
25	Correct	37 ms	3484 KB	Output is correct
26	Correct	79 ms	6764 KB	Output is correct
27	Correct	5 ms	512 KB	Output is correct
28	Correct	91 ms	8984 KB	Output is correct
29	Correct	40 ms	4204 KB	Output is correct
30	Correct	80 ms	8148 KB	Output is correct
31	Correct	5 ms	384 KB	Output is correct
32	Correct	5 ms	384 KB	Output is correct
33	Correct	5 ms	384 KB	Output is correct
34	Correct	5 ms	384 KB	Output is correct
35	Correct	5 ms	384 KB	Output is correct
36	Correct	5 ms	384 KB	Output is correct
37	Correct	5 ms	384 KB	Output is correct
38	Correct	5 ms	384 KB	Output is correct
39	Correct	5 ms	384 KB	Output is correct
40	Correct	5 ms	384 KB	Output is correct
41	Correct	203 ms	6764 KB	Output is correct
42	Correct	30 ms	1536 KB	Output is correct
43	Correct	23 ms	1736 KB	Output is correct
44	Correct	92 ms	5944 KB	Output is correct
45	Correct	206 ms	6636 KB	Output is correct
46	Correct	61 ms	3796 KB	Output is correct
47	Correct	28 ms	1532 KB	Output is correct
48	Correct	205 ms	6632 KB	Output is correct
49	Correct	207 ms	6760 KB	Output is correct
50	Correct	73 ms	3664 KB	Output is correct
51	Correct	32 ms	2104 KB	Output is correct
52	Correct	214 ms	8040 KB	Output is correct
53	Correct	211 ms	7832 KB	Output is correct
54	Correct	47 ms	2924 KB	Output is correct
55	Correct	110 ms	5232 KB	Output is correct
56	Correct	75 ms	5204 KB	Output is correct
57	Correct	75 ms	4564 KB	Output is correct
58	Correct	219 ms	8044 KB	Output is correct
59	Correct	54 ms	2668 KB	Output is correct
60	Correct	75 ms	3684 KB	Output is correct

Submission #242468

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 14.0 / 14.0

Subtask #3 20.0 / 20.0

Subtask #4 21.0 / 21.0

Subtask #5 22.0 / 22.0

Subtask #6 13.0 / 13.0

Subtask #1
10.0 / 10.0

Subtask #2
14.0 / 14.0

Subtask #3
20.0 / 20.0

Subtask #4
21.0 / 21.0

Subtask #5
22.0 / 22.0

Subtask #6
13.0 / 13.0