oj.uz

Submission #31321

# Submission time Handle Problem Language Result Execution time Memory
31321 2017-08-18T02:04:52 Z nibnalin Palembang Bridges (APIO15_bridge) C++14
0 / 100
 0 ms 2020 KB 
#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 += 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 += abs(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

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
0 / 8.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2020 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2020 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2020 KB Output isn't correct
2 Halted 0 ms 0 KB -