Submission #31322

#	Time	Username	Problem	Language	Result	Execution time	Memory
31322		nibnalin	Palembang Bridges (APIO15_bridge)	C++14	22 / 100	189 ms	5176 KiB

bridge

#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;

typedef long long int lli;

const lli maxn = lli(1e6)+5;

vector<lli> A;

void solve2(lli n)
{
	printf("-1\n");
}

void solve1(lli n)
{
	lli res = 0;
    for(lli i = 0;i < n;i++)
    {
        string s, t;
        lli a, b;
        cin >> s >> a >> t >> b;
        if(s == t) res += llabs(b-a);
        else
        {
        	A.push_back(a), A.push_back(b);
        	res++;
        }
    }

    sort(A.begin(), A.end());

    lli mid = A[(lli(A.size())-1)/2];

    //cout << mid << "\n";
    for(auto it: A)
    {
        res += llabs(it-mid);
    }
    printf("%lld\n", res);
}

int main(void)
{
    lli n, k;
    scanf("%lld%lld", &k, &n);
    if(k == 1) solve1(n);
    else solve2(n);
}

Compilation message (stderr)

bridge.cpp: In function 'int main()':
bridge.cpp:50:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%lld", &k, &n);
                              ^

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