oj.uz

Submission #43390

# Submission time Handle Problem Language Result Execution time Memory
43390 2018-03-15T10:33:44 Z top34051 Palembang Bridges (APIO15_bridge) C++14
22 / 100
 81 ms 2284 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 2e5 + 5;
int n,m,k,sz;
int a[maxn], b[maxn];
int pos[maxn];
ll solve1() {
    ll res = 0;
    sz = 0;
    for(int i=1;i<=n;i++) pos[sz++] = a[i], pos[sz++] = b[i];
    sort(&pos[0],&pos[sz]);
    int opt = pos[sz/2];
    for(int i=0;i<sz;i++) res += abs(opt-pos[i]);
    return res;
}
int main() {
    long long extra = 0;
    scanf("%d%d",&k,&n);
    for(int i=1;i<=n;i++) {
        int x, y; char t1, t2;
        scanf(" %c%d %c%d",&t1,&x,&t2,&y);
        if(t1==t2) extra += abs(x-y);
        else {
            m++;
            a[m] = x; b[m] = y;
            extra++;
        }
    }
    n = m;
    printf("%lld",extra + solve1());
}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:19:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&k,&n);
                        ^
bridge.cpp:22:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf(" %c%d %c%d",&t1,&x,&t2,&y);
                                          ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 2 ms 440 KB Output is correct
6 Correct 2 ms 496 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 2 ms 620 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 30 ms 2160 KB Output is correct
13 Correct 63 ms 2160 KB Output is correct
14 Correct 47 ms 2160 KB Output is correct
15 Correct 39 ms 2160 KB Output is correct
16 Correct 39 ms 2160 KB Output is correct
17 Correct 49 ms 2160 KB Output is correct
18 Correct 49 ms 2224 KB Output is correct
19 Correct 81 ms 2284 KB Output is correct
20 Correct 41 ms 2284 KB Output is correct
21 Correct 53 ms 2284 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2284 KB Output is correct
2 Correct 2 ms 2284 KB Output is correct
3 Incorrect 2 ms 2284 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2284 KB Output is correct
2 Correct 2 ms 2284 KB Output is correct
3 Incorrect 2 ms 2284 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2284 KB Output is correct
2 Correct 2 ms 2284 KB Output is correct
3 Incorrect 2 ms 2284 KB Output isn't correct
4 Halted 0 ms 0 KB -