Submission #3600159
Source Code Expand
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
int compare_int(const void *a, const void *b)
{
return *(int*)a - *(int*)b;
}
int main(void)
{
//変数の宣言
int w,h;
static int p[100010];
static int q[100010];
static int pnum[100010];
static int qnum[100010];
int i,j,k;
long long int ans;
int flag=0;
//データの読み込み
scanf("%d %d",&w,&h);
for(i=0;i<w;i++){
scanf("%d",&p[i]);
}
for(i=0;i<h;i++){
scanf("%d",&q[i]);
}
// printf("nは%dです\n", n);
// printf("データの読み込み終了\n");
//実際の処理
qsort(p, w, sizeof(int), compare_int);
qsort(q, h, sizeof(int), compare_int);
i=0;
j=0;
while(flag==0){
if(i<w&&j<h){
if(p[i]<q[j]){
pnum[i]=h-j+1;
// printf("p=%d,pnum=%d\n",p[i],pnum[i]);
i++;
}else{
qnum[j]=w-i+1;
// printf("q=%d,qnum=%d\n",q[j],qnum[j]);
j++;
}
}else if(i==w&&j!=h){
qnum[j]=1;
j++;
}else if(j==h&&i!=w){
pnum[i]=1;
i++;
}else{
flag=1;
}
}
ans=0;
for(i=0;i<w;i++){
ans=ans+p[i]*pnum[i];
}
for(i=0;i<h;i++){
ans=ans+q[i]*qnum[i];
}
// printf("計算部分終了\n");
//出力
printf("%lld",ans);
// printf("結果の出力終了\n");
}
Submission Info
Submission Time
2018-11-14 22:51:52+0900
Task
C - Gr-idian MST
User
rausumaru
Language
C (GCC 5.4.1)
Score
0
Code Size
1314 Byte
Status
WA
Exec Time
55 ms
Memory
2164 KB
Compile Error
./Main.c: In function ‘main’:
./Main.c:24:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&w,&h);
^
./Main.c:27:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&p[i]);
^
./Main.c:30:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&q[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 500
Status
Set Name
Test Cases
Sample
s1.txt, s2.txt
All
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, s1.txt, s2.txt
Case Name
Status
Exec Time
Memory
01.txt
WA
50 ms
2164 KB
02.txt
WA
49 ms
2164 KB
03.txt
WA
49 ms
2164 KB
04.txt
WA
49 ms
2164 KB
05.txt
WA
55 ms
2164 KB
06.txt
WA
49 ms
2164 KB
07.txt
WA
49 ms
2164 KB
08.txt
WA
49 ms
2164 KB
09.txt
WA
49 ms
2164 KB
10.txt
WA
49 ms
2164 KB
11.txt
WA
41 ms
2104 KB
12.txt
WA
41 ms
1908 KB
13.txt
WA
33 ms
1976 KB
14.txt
WA
49 ms
2164 KB
15.txt
WA
49 ms
2164 KB
16.txt
WA
25 ms
1012 KB
17.txt
WA
25 ms
1012 KB
18.txt
WA
25 ms
1012 KB
19.txt
WA
25 ms
1012 KB
20.txt
AC
24 ms
1976 KB
21.txt
AC
37 ms
2104 KB
22.txt
AC
36 ms
1908 KB
23.txt
WA
28 ms
1976 KB
24.txt
WA
33 ms
1976 KB
25.txt
AC
1 ms
128 KB
26.txt
AC
1 ms
128 KB
27.txt
AC
1 ms
128 KB
28.txt
AC
1 ms
128 KB
s1.txt
AC
1 ms
128 KB
s2.txt
AC
1 ms
128 KB