oj.uz

Submission #582697

# Submission time Handle Problem Language Result Execution time Memory
582697 2022-06-24T09:33:49 Z chirathnirodha Autobahn (COI21_autobahn) C++17
100 / 100
 128 ms 16868 KB 
//Coded by Chirath Nirodha
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define P push
#define I insert
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
const ll mod=1e9+7;
inline void io(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
}
void solve(){
    io();
	ll n,k,x;cin>>n>>k>>x;
	vector<pair<ll,int> > v;
	for(int i=0;i<n;i++){
		ll l,t,r;
		cin>>l>>t>>r;
		l--;
		v.PB(MP(l,1));
		v.PB(MP(r,2));
		v.PB(MP(l+x,3));
		v.PB(MP(r+x,4));
		if(r-l-t<=0)continue;
		v.PB(MP(l+t,5));
		v.PB(MP(r,6));
		v.PB(MP(l+t+x,7));
		v.PB(MP(r+x,8));
	}
	sort(v.begin(),v.end());
	ll pos=-x,inc=0,dec=0,cnt=0,cntp=0,val=0;
	ll ans=0;
	for(int i=0;i<v.size();i++){
		ll d=v[i].F-(pos+x);
		if(cnt>=k)val+=inc*d;
		if(cntp>=k)val+=dec*d;
		ans=max(ans,val);
		if(v[i].S==1)cnt++;
		else if(v[i].S==2)cnt--;
		else if(v[i].S==3)cntp++;
		else if(v[i].S==4)cntp--;
		else if(v[i].S==5)inc++;
		else if(v[i].S==6)inc--;
		else if(v[i].S==7)dec--;
		else dec++;
		pos+=d;
	}
	cout<<ans<<endl;
}
int main(){
    io();
	solve();
	//int t;cin>>t;for(int i=0;i<t;i++)solve();
    return 0;
}

Compilation message

autobahn.cpp: In function 'void solve()':
autobahn.cpp:43:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |  for(int i=0;i<v.size();i++){
      |              ~^~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 124 ms 16840 KB Output is correct
22 Correct 128 ms 16836 KB Output is correct
23 Correct 120 ms 16804 KB Output is correct
24 Correct 120 ms 16764 KB Output is correct
25 Correct 123 ms 16868 KB Output is correct
26 Correct 120 ms 16788 KB Output is correct
27 Correct 125 ms 16808 KB Output is correct
28 Correct 122 ms 16756 KB Output is correct
29 Correct 115 ms 16820 KB Output is correct