제출 #879658

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
879658		amin_2008	Art Exhibition (JOI18_art)	C++17	0 / 100	0 ms	348 KiB

art

#pragma GCC optimize ("O3")
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

// author: amin_2008

#define ios          ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ll           long long
#define vi           vector<int>
#define vs           vector<string>
#define vc           vector<char>
#define vl           vector<ll>
#define all(v)       v.begin(), v.end()
#define rall(v)      v.rbegin(), v.rend()
#define pb           push_back
#define bpc          __builtin_popcount
#define pii          pair<int, int>
#define pll          pair<ll, ll>
#define piii         pair<pii, int>
#define vpii         vector<pii>
#define vpll         vector<pll>
#define vvpii        vector<vpii>
#define vvi          vector<vector<int>>
#define vvl          vector<vector<ll>>
#define ins          insert
#define ts           to_string
#define F            first
#define S            second
#define lb           lower_bound
#define ub           upper_bound
#define ld           long double
#define ull          unsigned long long
#define endl         '\n'
#define int          ll

using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
template<class T> using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int inf = 1e9;
const int mod = 1e9+7;
const int sz = 2e5+5;
const int N = 100005;
const int logg = 18;
const int P = 40000005;
const int M = 5e5+5;

int a[sz];

void solve()
{
    int n;
    cin >> n;
    map<pii, int> m;
    int s = 0;
    while ( n-- )
    {
        int a, b;
        cin >> a >> b;
        m[{a, b}] = abs(a - b);
    }
    int minabs = LLONG_MAX;
    vpii neww;
    for(const auto& i : m)
        if ( i.S < minabs )
            minabs = i.S;
    for(const auto& i : m)
        if ( i.S == minabs )
            neww.pb(make_pair(i.F.F, i.F.S));
    int maks = LLONG_MIN, mini = LLONG_MAX;
    for(auto i : neww)
    {
        s += i.S;
        if ( i.F > maks )
            maks = i.F;
        if ( i.F < mini )
            mini = i.F;
    }
    cout << s - ( maks - mini ) << endl;
}

signed main()
{
    ios;
    //precompute();
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50