Submission #924428

#	Time	Username	Problem	Language	Result	Execution time	Memory
924428		Baizho	Stove (JOI18_stove)	C++14	100 / 100	31 ms	6744 KiB

stove

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
 
int n, k, t[N];	
 
void Baizho() {
	cin>>n>>k;
	multiset<int> st;
	int last = 0, ans = 0, siz = 0, cur = 1;
	for(int i = 1; i <= n; i ++) {
		cin>>t[i];
		if(i > 1) {
			if(t[i - 1] + 2 == t[i]) {
				ans += cur - 1;
				cur = 1;
				ans += 1;
				st.insert(1);
			} else if(t[i - 1] + 1 == t[i]) {
				cur ++;
			} else {
				ans += cur - 1;
				cur = 1;
				ans ++;
				st.insert(t[i] - t[i - 1] - 1);
			}
		} else ans = 1;
//		cout<<i<<" "<<ans<<endl;
	}
	ans += cur - 1;
//	cout<<ans<<endl;
	while(st.size() + 1 > k) {
		ans += *st.begin();
		st.erase(st.begin());
	}
	cout<<ans;
	
	
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message (stderr)

stove.cpp: In function 'void Baizho()':
stove.cpp:64:22: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   64 |  while(st.size() + 1 > k) {
      |        ~~~~~~~~~~~~~~^~~
stove.cpp:42:6: warning: unused variable 'last' [-Wunused-variable]
   42 |  int last = 0, ans = 0, siz = 0, cur = 1;
      |      ^~~~
stove.cpp:42:25: warning: unused variable 'siz' [-Wunused-variable]
   42 |  int last = 0, ans = 0, siz = 0, cur = 1;
      |                         ^~~
stove.cpp: In function 'void Freopen(std::string)':
stove.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
stove.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50