Submission #31320

#	Time	Username	Problem	Language	Result	Execution time	Memory
31320		nibnalin	Palembang Bridges (APIO15_bridge)	C++14	0 / 100	0 ms	2020 KiB

bridge

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

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

vector<int> A;

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

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

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

    int mid = A[(int(A.size())-1)/2];
    
    //cout << mid << "\n";
    for(auto it: A)
    {
        res += abs(it-mid);
    }
    printf("%d\n", res);
}

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

Compilation message (stderr)

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

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