oj.uz

답안 #972898

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972898 2024-05-01T09:52:58 Z sleepntsheep Palembang Bridges (APIO15_bridge) C
22 / 100
 46 ms 10324 KB 
#include <stdio.h>
#include <stdlib.h>
#define MAX_N 2000000

int min(int a,int b){return a<b?a:b;}
int max(int a,int b){return a>b?a:b;}
int cmpr(const void*a,const void*b){return *(const int*)a - *(const int*)b;}

int n, k, a[MAX_N], b[MAX_N], c[MAX_N<<1], o, p;
long long cost;

int main()
{
    scanf("%d%d", &k, &n);
    for (int s, t, i = 0; i < n; ++i)
    {
        char bb, cc;
        scanf(" %c%d %c%d",&bb,&s,&cc,&t);
        if(bb==cc) cost += abs(t-s);
        else
        {
            a[o] = min(s, t);
            b[o] = max(s, t);
            c[p++] = s; c[p++] = t;
            ++o;
            ++cost;
        }
    }

    if(k==1)
    {
        qsort(c, p, sizeof*c, cmpr);
        for(int j=0;j<p;++j)
            cost += abs(c[p/2] - c[j]);
        printf("%lld\n", cost);
    }

}

Compilation message

bridge.c: In function 'main':
bridge.c:14:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     scanf("%d%d", &k, &n);
      |     ^~~~~~~~~~~~~~~~~~~~~
bridge.c:18:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |         scanf(" %c%d %c%d",&bb,&s,&cc,&t);
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4540 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4548 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4540 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 25 ms 8620 KB Output is correct
13 Correct 46 ms 10284 KB Output is correct
14 Correct 36 ms 9040 KB Output is correct
15 Correct 25 ms 6740 KB Output is correct
16 Correct 27 ms 9296 KB Output is correct
17 Correct 27 ms 9812 KB Output is correct
18 Correct 37 ms 9812 KB Output is correct
19 Correct 38 ms 10324 KB Output is correct
20 Correct 29 ms 9808 KB Output is correct
21 Correct 30 ms 10076 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -