oj.uz

Submission #969532

# Submission time Handle Problem Language Result Execution time Memory
969532 2024-04-25T09:37:20 Z batsukh2006 Palembang Bridges (APIO15_bridge) C++17
22 / 100
 242 ms 20544 KB 
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map> 
#include<numeric>
#include<tuple>
#include<bitset>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define MOD 1000000007
#define int long long
#define ss second
#define ff first
#define endl '\n'
#define ordered_set tree<pair<int, int>, null_type, less<pair<int, int> >, rb_tree_tag, tree_order_statistics_node_update>
signed main(){
    // freopen("file.in", "r", stdin);
    // freopen("file.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int k,n; cin>>k>>n;
    int sum=0;
    vector<pair<int,int> > v,d;
    for(int i=0; i<n; i++){
    	int s,t;
    	char p,q;
    	cin>>p>>s>>q>>t;
    	if(p==q){
    		sum+=abs(s-t);
    	}else{
    		sum++;
    		v.push_back({s,i});
    		v.push_back({t,i});
    		d.push_back({s,t});
    	}
    }
    if(v.empty()){
    	cout<<sum;
    	return 0;
    }
    int sl=0,sr=0;
    ordered_set f,s;
    vector<bool> vis(n);
    sort(v.begin(),v.end());
    int ml=0,mr=v[v.size()/2].ff;
    for(int i=0; i<v.size(); i++){
    	sr+=abs(mr-v[i].ff);
    	s.insert({v[i].ff,v[i].ss});
    }
    int res=sl+sr;
    if(k==1){
	    cout<<res+sum;
	}else{
		for(int i=0; i<v.size(); i++){
			if(!vis[v[i].ss]){
				vis[v[i].ss]=1;
				s.erase({d[v[i].ss].ff,v[i].ss});
				s.erase({d[v[i].ss].ss,v[i].ss});
				f.insert({d[v[i].ss].ff,v[i].ss});
				f.insert({d[v[i].ss].ss,v[i].ss});
				int fh=f.size()/2,sh=s.size()/2;
				int pl=(*f.find_by_order(fh)).ff;
				int pr=(*s.find_by_order(sh)).ff;
				sl+=abs(d[v[i].ss].ff-ml);
				sl+=abs(d[v[i].ss].ss-ml);
				sl+=fh*(pl-ml);
				sl-=(f.size()-fh)*(pl-ml);
				sr-=abs(d[v[i].ss].ff-mr);
				sr-=abs(d[v[i].ss].ss-mr);
				sr+=sh*(pr-mr);
				sr-=(s.size()-sh)*(pr-mr);
				ml=pl;
				mr=pr;
				res=min(res,sl+sr);
			}
		}
		cout<<res+sum;
	}
    return 0;
}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:64:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for(int i=0; i<v.size(); i++){
      |                  ~^~~~~~~~~
bridge.cpp:72:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |   for(int i=0; i<v.size(); i++){
      |                ~^~~~~~~~~

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 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 468 KB Output is correct

Subtask #2
14.0 / 14.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 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 173 ms 15216 KB Output is correct
13 Correct 227 ms 19716 KB Output is correct
14 Correct 198 ms 16948 KB Output is correct
15 Correct 83 ms 11796 KB Output is correct
16 Correct 242 ms 19996 KB Output is correct
17 Correct 213 ms 20544 KB Output is correct
18 Correct 212 ms 20020 KB Output is correct
19 Correct 213 ms 19248 KB Output is correct
20 Correct 124 ms 13116 KB Output is correct
21 Correct 221 ms 20292 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
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 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -