oj.uz

Submission #961871

# Submission time Handle Problem Language Result Execution time Memory
961871 2024-04-12T15:31:23 Z vjudge1 Palembang Bridges (APIO15_bridge) C++14
100 / 100
 266 ms 13512 KB 
#include<bits/stdc++.h>

using namespace std;

#define int long long

int k, n;

namespace sub12{
   void solve(){
      vector<int> v;
      int ans=0;
      for (int i=1; i<=n; ++i){
         char c1, c2; int p1, p2;
         cin >> c1 >> p1 >> c2 >> p2;
         if (c1==c2) ans+=abs(p1-p2);
         else v.push_back(p1), v.push_back(p2);
      }
      sort(v.begin(), v.end());
      if (v.size()){
         int pos=v[(int)v.size()/2];
         for (int i:v) ans+=abs(pos-i);
      }
      cout << ans+(int)v.size()/2 << '\n';
   }
}

struct Median{
   multiset<int, greater<int>> stl;
   int suml;
   multiset<int> str;
   int sumr;
   void adjust(){
      while ((int)stl.size()-(int)str.size()>1){
         int tmp=*stl.begin();
         str.insert(tmp); sumr+=tmp;
         stl.erase(stl.begin()); suml-=tmp;
      }
      while ((int)str.size()-(int)stl.size()>0){
         int tmp=*str.begin();
         stl.insert(tmp); suml+=tmp;
         str.erase(str.begin()); sumr-=tmp;
      }
   }
   void insert(int x){
      if (stl.empty() || *stl.begin()>=x) stl.insert(x), suml+=x;
      else str.insert(x), sumr+=x;
      adjust();
   }
   void erase(int x){
      if (stl.find(x)!=stl.end()) stl.erase(stl.find(x)), suml-=x;
      else str.erase(str.find(x)), sumr-=x;
      adjust();
   }
   int calc(){
      if (stl.empty()) return 0;
      int median=*stl.begin();
      return sumr-median*((int)str.size())+median*((int)stl.size())-suml;
   }
};

namespace sub345{
   Median st1, st2;
   void solve(){
      int add=0;
      vector<pair<int, int>> v;
      for (int i=1; i<=n; ++i){
         char c1, c2; int p1, p2;
         cin >> c1 >> p1 >> c2 >> p2;
         if (c1==c2) add+=abs(p1-p2);
         else v.emplace_back(p1, p2);
      }
      sort(v.begin(), v.end(), [&](pair<int, int> x, pair<int, int> y){
         return x.first+x.second<y.first+y.second;
      }); 
      int ans=1e18;
      for (auto &i:v) st2.insert(i.first), st2.insert(i.second);
      for (int i=0; i<=(int)v.size(); ++i){
         ans=min(ans, st1.calc()+st2.calc());
         if (i<(int)v.size()){
            st2.erase(v[i].first);
            st2.erase(v[i].second);
            st1.insert(v[i].first);
            st1.insert(v[i].second);
         }
      }
      cout << add+ans+(int)v.size() << '\n';
   }
}

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> k >> n;
   if (k==1) sub12::solve();
   else sub345::solve();
   return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 18 ms 2520 KB Output is correct
13 Correct 38 ms 2452 KB Output is correct
14 Correct 23 ms 2516 KB Output is correct
15 Correct 18 ms 1500 KB Output is correct
16 Correct 18 ms 2520 KB Output is correct
17 Correct 24 ms 2432 KB Output is correct
18 Correct 26 ms 2520 KB Output is correct
19 Correct 31 ms 2516 KB Output is correct
20 Correct 21 ms 2772 KB Output is correct
21 Correct 27 ms 2520 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1 ms 452 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 576 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 472 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 352 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 141 ms 11972 KB Output is correct
26 Correct 226 ms 12244 KB Output is correct
27 Correct 263 ms 12820 KB Output is correct
28 Correct 266 ms 13480 KB Output is correct
29 Correct 229 ms 13512 KB Output is correct
30 Correct 105 ms 7032 KB Output is correct
31 Correct 94 ms 12732 KB Output is correct
32 Correct 131 ms 13512 KB Output is correct
33 Correct 106 ms 13004 KB Output is correct
34 Correct 136 ms 13100 KB Output is correct
35 Correct 150 ms 12648 KB Output is correct
36 Correct 138 ms 13000 KB Output is correct
37 Correct 127 ms 11968 KB Output is correct