oj.uz

Submission #246080

# Submission time Handle Problem Language Result Execution time Memory
246080 2020-07-08T06:59:09 Z leaked Unija (COCI17_unija) C++14
100 / 100
 515 ms 36864 KB 
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout<< *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int N=2e6+1;
const int M=999999937;
int st[N];
signed main(){
    fast_io;
    int n;
    cin>>n;
    ll ans=0;
    ll mx=0;
    vector<pll>a(n);
    for(auto &z : a) cin>>z.f>>z.s,z.s=-z.s;
    sort(all(a));
    for(int i=0;i<n;i++) st[i]=(i? a[i-1].f/2 : 0);
    ll s=0,to=0;
    vector<pll>lol;
   // lol.p_b({0,0});
    for(int i=0;i<n;i++){
        a[i].f/=2;a[i].s=-a[i].s/2;
        while(sz(lol) && a[i].s>lol.back().s){
            ans-=lol.back().s*(a[lol.back().f].f-st[lol.back().f]);
            st[i]=st[lol.back().f];
            lol.pop_back();
        }
        ans+=(a[i].f-st[i])*a[i].s;
//        debug()<<imie(a[i])<<imie(st[i]);
        lol.p_b({i,a[i].s});
//       cout<<ans<<endl;
      //  mx=max(mx,(ll)a[i].s);
    }
    cout<<ans*4;
    return 0;
}
///stuff you should look for :
/*
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* read the conditions carefully
	* WRITE STUFF DOWN
*/

Compilation message

unija.cpp: In function 'int main()':
unija.cpp:85:8: warning: unused variable 'mx' [-Wunused-variable]
     ll mx=0;
        ^~
unija.cpp:43:11: warning: unused variable 'second' [-Wunused-variable]
 #define s second
           ^
unija.cpp:90:8: note: in expansion of macro 's'
     ll s=0,to=0;
        ^
unija.cpp:90:12: warning: unused variable 'to' [-Wunused-variable]
     ll s=0,to=0;
            ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct

Subtask #2
10.0 / 10.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

Subtask #3
10.0 / 10.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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 768 KB Output is correct
2 Correct 6 ms 768 KB Output is correct
3 Correct 6 ms 768 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 383 ms 36864 KB Output is correct
2 Correct 515 ms 36836 KB Output is correct
3 Correct 384 ms 36852 KB Output is correct

Subtask #6
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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1280 KB Output is correct
2 Correct 15 ms 1280 KB Output is correct
3 Correct 14 ms 1280 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 2808 KB Output is correct
2 Correct 38 ms 2960 KB Output is correct
3 Correct 38 ms 2936 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 6776 KB Output is correct
2 Correct 108 ms 6776 KB Output is correct
3 Correct 109 ms 6840 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 376 ms 20344 KB Output is correct
2 Correct 365 ms 20344 KB Output is correct
3 Correct 367 ms 20216 KB Output is correct