oj.uz

답안 #971504

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971504 2024-04-28T17:00:38 Z batsukh2006 Palembang Bridges (APIO15_bridge) C++17
100 / 100
 452 ms 18400 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_equal<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,j=0; i<n; i++){
    	int s,t;
    	char p,q;
    	cin>>p>>s>>q>>t;
    	if(p==q){
    		sum+=abs(s-t);
    	}else{
    		sum++;
    		d.push_back({s,t});
    		v.push_back({s+t,j});
    		j++;
    	}
    }
    if(v.empty()){
    	cout<<sum;
    	return 0;
    }
    int sl=0,sr=0;
    ordered_set f,s;
    sort(v.begin(),v.end());
    for(int i=0; i<v.size(); i++){
    	s.insert({d[v[i].ss].ff,v[i].ss});
    	s.insert({d[v[i].ss].ss,v[i].ss});
    }
    int ml=(*s.find_by_order(1)).ff;
	int mr=(*s.find_by_order(s.size()/2)).ff;
    for(int i=0; i<v.size(); i++){
    	sr+=abs(mr-d[v[i].ss].ff);
    	sr+=abs(mr-d[v[i].ss].ss);
    }
    int res=sl+sr;
    if(k==1){
	    cout<<res+sum;
	}else{
		for(int i=0; i<v.size(); i++){
			s.erase(s.upper_bound({d[v[i].ss].ff,v[i].ss}));
			s.erase(s.upper_bound({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()-1)/2,sh=s.size()/2;
			int pl=(*f.find_by_order(fh)).ff;
			int pr=(*s.find_by_order(sh)).ff;
			if(f.size()==2) ml=pl;
			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:62: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]
   62 |     for(int i=0; i<v.size(); i++){
      |                  ~^~~~~~~~~
bridge.cpp:68: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]
   68 |     for(int i=0; i<v.size(); i++){
      |                  ~^~~~~~~~~
bridge.cpp:76: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]
   76 |   for(int i=0; i<v.size(); i++){
      |                ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 600 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 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 428 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 476 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 100 ms 16816 KB Output is correct
13 Correct 131 ms 18100 KB Output is correct
14 Correct 102 ms 15672 KB Output is correct
15 Correct 61 ms 10940 KB Output is correct
16 Correct 109 ms 17496 KB Output is correct
17 Correct 103 ms 18092 KB Output is correct
18 Correct 105 ms 17884 KB Output is correct
19 Correct 106 ms 18328 KB Output is correct
20 Correct 166 ms 17932 KB Output is correct
21 Correct 108 ms 17920 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 500 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 0 ms 348 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 1 ms 356 KB Output is correct
11 Correct 1 ms 352 KB Output is correct
12 Correct 1 ms 356 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 1 ms 356 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 352 KB Output is correct
7 Correct 1 ms 356 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 0 ms 464 KB Output is correct
11 Correct 0 ms 460 KB Output is correct
12 Correct 0 ms 360 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 1 ms 456 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 600 KB Output is correct

Subtask #5
37.0 / 37.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 0 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 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 1 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 636 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 219 ms 16888 KB Output is correct
26 Correct 284 ms 16812 KB Output is correct
27 Correct 362 ms 17740 KB Output is correct
28 Correct 348 ms 18340 KB Output is correct
29 Correct 344 ms 18400 KB Output is correct
30 Correct 138 ms 9648 KB Output is correct
31 Correct 230 ms 17344 KB Output is correct
32 Correct 248 ms 18012 KB Output is correct
33 Correct 278 ms 17788 KB Output is correct
34 Correct 218 ms 17844 KB Output is correct
35 Correct 446 ms 17500 KB Output is correct
36 Correct 307 ms 17844 KB Output is correct
37 Correct 452 ms 16772 KB Output is correct