oj.uz

Submission #32179

# Submission time Handle Problem Language Result Execution time Memory
32179 2017-10-03T05:35:23 Z minchurl Palembang Bridges (APIO15_bridge) C++11
22 / 100
 76 ms 2672 KB 
#include<stdio.h>
#include<math.h>
#include<algorithm>
#define MAX_N 100005
#define abs(x) ((x)>0?(x):(-(x)))
#define LL long long
using namespace std;
LL N,K;
LL arr[2*MAX_N],ans;
LL input(){
	LL i,n,S,T,sum=0;
	char P[2],Q[2];
	n=0;
	for(i=0;i<N;i++){
		scanf("%s %lld %s %lld",P,&S,Q,&T);
		if(P[0]==Q[0]){
			sum+=abs(S-T);
		}else{
			arr[++n]=S;arr[++n]=T;
			sum++;
		}
	}
	N=n;
	return sum;
}
LL bridge_only(){
	LL i,x,sum=0;
	sort(arr+1,arr+N+1);
	x=N/2;
	for(i=1;i<=N;i++)	sum+=abs(arr[i]-arr[x]);
	return sum;
}
int main(){
	LL base;
	scanf("%lld %lld",&K,&N);
	base=input();
	ans=bridge_only()+base;
	if(K==1){
		printf("%lld\n",ans);
		return 0;
	}
	
	return 0;
}

Compilation message

bridge.cpp: In function 'long long int input()':
bridge.cpp:15:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s %lld %s %lld",P,&S,Q,&T);
                                     ^
bridge.cpp: In function 'int main()':
bridge.cpp:35:26: 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.0 / 8.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2672 KB Output is correct
2 Correct 0 ms 2672 KB Output is correct
3 Correct 0 ms 2672 KB Output is correct
4 Correct 0 ms 2672 KB Output is correct
5 Correct 0 ms 2672 KB Output is correct
6 Correct 0 ms 2672 KB Output is correct
7 Correct 0 ms 2672 KB Output is correct
8 Correct 0 ms 2672 KB Output is correct
9 Correct 0 ms 2672 KB Output is correct
10 Correct 0 ms 2672 KB Output is correct
11 Correct 0 ms 2672 KB Output is correct
12 Correct 33 ms 2672 KB Output is correct
13 Correct 76 ms 2672 KB Output is correct
14 Correct 49 ms 2672 KB Output is correct
15 Correct 43 ms 2672 KB Output is correct
16 Correct 43 ms 2672 KB Output is correct
17 Correct 43 ms 2672 KB Output is correct
18 Correct 43 ms 2672 KB Output is correct
19 Correct 59 ms 2672 KB Output is correct
20 Correct 39 ms 2672 KB Output is correct
21 Correct 63 ms 2672 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2672 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 2672 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 2672 KB Output isn't correct
2 Halted 0 ms 0 KB -