oj.uz

Submission #364262

# Submission time Handle Problem Language Result Execution time Memory
364262 2021-02-08T16:18:27 Z ACmachine Palembang Bridges (APIO15_bridge) C++17
100 / 100
 529 ms 13032 KB 
#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;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

struct superset{
    multiset<int> F;
    multiset<int> S;
    ll fsum = 0;
    ll ssum = 0;
    void insf(int x){
        fsum += x;
        F.insert(x);
    }
    void inss(int x){
        ssum += x;
        S.insert(x);
    }
    void ersf(int x){
        fsum -= x;
        F.erase(F.find(x));
    }
    void erss(int x){
        ssum -= x;
        S.erase(S.find(x));
    }
    void balance(){
        int siz = F.size() + S.size();
        int nxts = (siz % 2 == 0 ? siz / 2 : siz / 2 + 1);
        while(F.size() < nxts){
            insf(*S.begin());
            erss(*S.begin());
        }
        while(F.size() > nxts){
            inss(*F.rbegin());
            ersf(*F.rbegin());
        }
    }
    void insert(int x){
        if(!S.empty() && x >= *S.begin()){
            inss(x);
        }
        else{
            insf(x);
        }
        balance();
    }
    void erase(int x){
        if(!S.empty() && x >= *S.begin()){
            erss(x);
        }
        else{
            ersf(x);
        }
        balance();
    }
    ll get_ans(){
        ll res = 0;
        if(F.size() == 0) return res;
        ll med = *F.rbegin();
        res = ssum - (ll)S.size() * med + (ll)F.size() * med - fsum;
        return res;
    }
};
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int k, n;
    cin >> k >> n;
    ll ans = 0;
    vector<array<int ,2>> a;
    REP(i, n){
        char p, q;
        int s, t;
        cin >> p >> s >> q >> t;
        if(p == q){
            ans += abs(s - t);
        }
        else{
            a.pb({s, t});
        }
    }
    ans += (int)a.size();
    sort(all(a), [](array<int, 2> lhs, array<int, 2> rhs){
        return lhs[0] + lhs[1] < rhs[0] + rhs[1];
    });
    if(k == 1){
        superset se;
        REP(i, a.size()){
            se.insert(a[i][0]);
            se.insert(a[i][1]);
        }
        ans += se.get_ans();
        cout << ans << "\n";
        return 0;
    }
    else{
        ll toadd = ans;
        ans = INFF;
        superset se1;
        superset se2; 
        REP(i, a.size()){
            se2.insert(a[i][0]);
            se2.insert(a[i][1]);
        }
        ans = min(ans, se1.get_ans() + se2.get_ans() + toadd);
        REP(i, a.size()){
            se1.insert(a[i][0]);
            se1.insert(a[i][1]);
            se2.erase(a[i][0]);
            se2.erase(a[i][1]);
            ans = min(ans, se1.get_ans() + se2.get_ans() + toadd);
        }
        cout << ans << "\n";
    }
    return 0;
}

Compilation message

bridge.cpp: In member function 'void superset::balance()':
bridge.cpp:108:24: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  108 |         while(F.size() < nxts){
      |               ~~~~~~~~~^~~~~~
bridge.cpp:112:24: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  112 |         while(F.size() > nxts){
      |               ~~~~~~~~~^~~~~~
bridge.cpp: In function 'int main()':
bridge.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
bridge.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
bridge.cpp:167:9: note: in expansion of macro 'REP'
  167 |         REP(i, a.size()){
      |         ^~~
bridge.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
bridge.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
bridge.cpp:180:9: note: in expansion of macro 'REP'
  180 |         REP(i, a.size()){
      |         ^~~
bridge.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
bridge.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
bridge.cpp:185:9: note: in expansion of macro 'REP'
  185 |         REP(i, a.size()){
      |         ^~~

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 90 ms 10600 KB Output is correct
13 Correct 155 ms 10472 KB Output is correct
14 Correct 133 ms 9448 KB Output is correct
15 Correct 76 ms 6380 KB Output is correct
16 Correct 82 ms 10472 KB Output is correct
17 Correct 91 ms 10472 KB Output is correct
18 Correct 79 ms 10624 KB Output is correct
19 Correct 98 ms 10472 KB Output is correct
20 Correct 92 ms 10660 KB Output is correct
21 Correct 95 ms 10472 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 3 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 2 ms 492 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 2 ms 492 KB Output is correct

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 2 ms 492 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 216 ms 11368 KB Output is correct
26 Correct 352 ms 11496 KB Output is correct
27 Correct 469 ms 12240 KB Output is correct
28 Correct 505 ms 12904 KB Output is correct
29 Correct 529 ms 12776 KB Output is correct
30 Correct 192 ms 6892 KB Output is correct
31 Correct 185 ms 12264 KB Output is correct
32 Correct 213 ms 12776 KB Output is correct
33 Correct 148 ms 12392 KB Output is correct
34 Correct 216 ms 13032 KB Output is correct
35 Correct 210 ms 12520 KB Output is correct
36 Correct 215 ms 12648 KB Output is correct
37 Correct 189 ms 11240 KB Output is correct