Submission #100840

#	Time	Username	Problem	Language	Result	Execution time	Memory
100840		nikolapesic2802	Safety (NOI18_safety)	C++14	100 / 100	78 ms	3708 KiB

safety

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " << (x) << "\n";

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}

int main()
{
	priority_queue<ll> lefts;
	priority_queue<ll,vector<ll>,greater<ll> > rights;
	int n,h;
	scanf("%i %i",&n,&h);
	int x;
	scanf("%i",&x);
	lefts.push(x);
	rights.push(x);
	ll sol=0;
	for(int i=1;i<n;i++)
    {
        int x;
        scanf("%i",&x);
        ll shift=(ll)i*h;
        ll left_border=lefts.top()-shift;
        ll right_border=rights.top()+shift;
        if(x<left_border)
        {
            lefts.push(x+shift);
            lefts.push(x+shift);
            lefts.pop();
            rights.push(left_border-shift);
            sol+=abs(left_border-x);
            continue;
        }
        if(x>right_border)
        {
            rights.push(x-shift);
            rights.push(x-shift);
            rights.pop();
            lefts.push(right_border+shift);
            sol+=abs(right_border-x);
            continue;
        }
        lefts.push(x+shift);
        rights.push(x-shift);
    }
    printf("%lld\n",sol);
    return 0;
}

Compilation message (stderr)

safety.cpp: In function 'int main()':
safety.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&h);
  ~~~~~^~~~~~~~~~~~~~~
safety.cpp:34:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&x);
  ~~~~~^~~~~~~~~
safety.cpp:41:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i",&x);
         ~~~~~^~~~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 4 / 4
• Subtask 3: 9 / 9
• Subtask 4: 5 / 5
• Subtask 5: 6 / 6
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 22 / 22
• Subtask 9: 29 / 29