oj.uz

Submission #25017

# Submission time Handle Problem Language Result Execution time Memory
25017 2017-06-20T04:09:23 Z 김현수(#1051) Palembang Bridges (APIO15_bridge) C++11
22 / 100
 83 ms 5176 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x, n, ans;
vector<ll> a;

void solve1() {
	for(ll i=0;i<a.size();i++) {
		ans += abs(a[i] - a[a.size()/2]);
	}
	printf("%lld\n",ans+a.size()/2);
}

void solve2() {}

int main()
{
	scanf("%lld%lld",&x,&n);
	for(int i=1;i<=n;i++) {
		ll A, B;
		char C[2], D[2];
		scanf("%s%lld%s%lld",C,&A,D,&B);
		if(C[0] == D[0]) ans += abs(A-B);
		else {a.push_back(A); a.push_back(B);}
	}
	sort(a.begin(), a.end());
	if(x == 1) solve1();
	else solve2();
}

Compilation message

bridge.cpp: In function 'void solve1()':
bridge.cpp:8:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(ll i=0;i<a.size();i++) {
              ^
bridge.cpp: In function 'int main()':
bridge.cpp:18:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld",&x,&n);
                         ^
bridge.cpp:22:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s%lld%s%lld",C,&A,D,&B);
                                  ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2020 KB Output is correct
2 Correct 0 ms 2020 KB Output is correct
3 Correct 0 ms 2020 KB Output is correct
4 Correct 0 ms 2020 KB Output is correct
5 Correct 0 ms 2020 KB Output is correct
6 Correct 0 ms 2020 KB Output is correct
7 Correct 0 ms 2020 KB Output is correct
8 Correct 0 ms 2020 KB Output is correct
9 Correct 0 ms 2020 KB Output is correct
10 Correct 0 ms 2020 KB Output is correct
11 Correct 0 ms 2020 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2020 KB Output is correct
2 Correct 0 ms 2020 KB Output is correct
3 Correct 0 ms 2020 KB Output is correct
4 Correct 0 ms 2020 KB Output is correct
5 Correct 0 ms 2020 KB Output is correct
6 Correct 0 ms 2020 KB Output is correct
7 Correct 0 ms 2020 KB Output is correct
8 Correct 0 ms 2020 KB Output is correct
9 Correct 0 ms 2020 KB Output is correct
10 Correct 0 ms 2020 KB Output is correct
11 Correct 0 ms 2020 KB Output is correct
12 Correct 26 ms 5176 KB Output is correct
13 Correct 83 ms 5176 KB Output is correct
14 Correct 53 ms 5176 KB Output is correct
15 Correct 49 ms 3640 KB Output is correct
16 Correct 46 ms 5176 KB Output is correct
17 Correct 43 ms 5176 KB Output is correct
18 Correct 49 ms 5176 KB Output is correct
19 Correct 69 ms 5176 KB Output is correct
20 Correct 39 ms 5176 KB Output is correct
21 Correct 49 ms 5176 KB Output is correct

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 -