# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
972948 | sleepntsheep | Bridges (APIO19_bridges) | C11 | 34 ms | 1672 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |