oj.uz

Submission #972949

# Submission time Handle Problem Language Result Execution time Memory
972949 2024-05-01T10:37:56 Z sleepntsheep Palembang Bridges (APIO15_bridge) C
22 / 100
 44 ms 4188 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, c[MAX_N<<1], 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
        {
            c[++p] = s; c[++p] = t;
            ++cost;
        }
    }

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

    /* some prefix of points will choose left bridge and the rest will choose right bridge
     *
     * - fix prefix and find optimal cost for that prefix
     */


    for (int i = 0; i < p; ++i)
    {
    }
}

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

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 1 ms 356 KB Output is correct
8 Correct 1 ms 356 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 1 ms 360 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 25 ms 2552 KB Output is correct
13 Correct 44 ms 4188 KB Output is correct
14 Correct 33 ms 2908 KB Output is correct
15 Correct 24 ms 2404 KB Output is correct
16 Correct 27 ms 3160 KB Output is correct
17 Correct 26 ms 3680 KB Output is correct
18 Correct 28 ms 3672 KB Output is correct
19 Correct 36 ms 4184 KB Output is correct
20 Correct 29 ms 3672 KB Output is correct
21 Correct 29 ms 3936 KB Output is correct

Subtask #3
0 / 9.0

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