Submission #48093

#	Time	Username	Problem	Language	Result	Execution time	Memory
48093		TheDarkning	Palembang Bridges (APIO15_bridge)	C++17	8 / 100	2063 ms	2284 KiB

bridge

/**
                  ▄█▀ ▀█▀ ▄▀▄ █▀ █▄█▄█ ▄▀▄ █▀ ▄█▀
                  <⇋⇋⇋⋛∰≓⊂(⌒,_ゝ⌒)⊃≓∰⋛⇋⇋⇋>

            ♔♕♖♗♘♙ ☜❷☞✪ ィℋ६ ≈ ᗫẵℜℵĬŊĞ ✪☜❷☞ ♚♛♜♝♞♟
            ♔♕♖♗♘♙                             ♚♛♜♝♞♟
                      ˙·٠•●♥ Ƹ̵̡Ӝ̵̨̄Ʒ ♥●•٠·˙
1 5
B 0 A 4
B 1 B 3
A 5 B 7
B 2 A 6
B 1 A 7

**/

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <time.h>
#include <map>
#include <deque>
#include <assert.h>
#include <queue>
#include <string>
#include <memory.h>
#include <set>
#include <math.h>

#define sz(s) s.size()
#define pb emplace_back
#define fr first
#define sc second
#define mk make_pair
#define int long long
#define all(s) s.begin(), s.end()
#define ok puts("ok");

using namespace std;

const int N = 2e5 + 5;
const int inf = 1e18 + 7;

int n, k, ans = inf, cnt, a[N], b[N];
char t1[N], t2[N];

main(){
    cin >> k >> n;
    for( int i = 1; i <= n; i++ ){
        cin >> t1[i] >> a[i] >> t2[i] >> b[i];
        if( t1[ i ] != t2[ i ] ){
            cnt ++;
        }
    }
    for( int i = 1; i <= n; i++ ){
        int sum = 0;
        for( int j = 1; j <= n; j++ ){
            if( t1[ j ] == t2[ j ] ){
                sum += abs( a[ j ] - b[ j ] );
                continue;
            }
            sum += abs( a[ j ] - a[ i ] ) + abs( b[ j ] - a[ i ] );
        }
        ans = min( ans, sum );
        sum = 0;
        for( int j = 1; j <= n; j++ ){
            if( t1[ j ] == t2[ j ] ){
                sum += abs( a[ j ] - b[ j ] );
                continue;
            }
            sum += abs( a[ j ] - b[ i ] ) + abs( b[ j ] - b[ i ] );
        }
        ans = min( ans, sum );
    }
    cout << ans + cnt;
}

Compilation message (stderr)

bridge.cpp:49:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

• Subtask 1: 8 / 8
• Subtask 2: 0 / 14
• Subtask 3: 0 / 9
• Subtask 4: 0 / 32
• Subtask 5: 0 / 37