oj.uz

답안 #100258

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100258 2019-03-10T07:04:49 Z pzdba Simfonija (COCI19_simfonija) C++14
77 / 110
 213 ms 2040 KB 
#include <bits/stdc++.h>
using namespace std;
long long oo = 1e18;
int n, k;
int a[100001], b[100001], c[100001], d[100001];
long long solve(int x){
    for(int i=1;i<=n;i++) d[i] = c[i]+x;
    int l = 1, r = n, cnt = 0;
    while(cnt < k){
        cnt++;
        if(abs(d[l]) > abs(d[r])) d[l] = 0, l++;
        else d[r] = 0, r--;
    }
    long long ans = 0;
    for(int i=1;i<=n;i++) ans += abs(d[i]);
    return ans;
}
int main(){
    scanf("%d%d", &n, &k);
    for(int i=1;i<=n;i++) scanf("%d", &a[i]);
    for(int i=1;i<=n;i++) scanf("%d", &b[i]);
    for(int i=1;i<=n;i++) c[i] = a[i]-b[i];
    sort(c+1, c+1+n);
    int lo = 0, hi = 1000000;
    long long ans = oo;
    for(int i=0;i<100;i++){
        int mid1 = lo + (hi-lo)/3;
        int mid2 = hi - (hi-lo)/3;
        long long result1 = solve(mid1);
        long long result2 = solve(mid2);
        if(result1 < result2){
            ans = min(ans, result1);
            hi = mid2;
        }
        else{
            ans = min(ans, result2);
            lo = mid1;
        }
    }
    lo = 0, hi = 1000000;
    for(int i=0;i<100;i++){
        int mid1 = lo + (hi-lo)/3;
        int mid2 = hi - (hi-lo)/3;
        long long result1 = solve(-mid1);
        long long result2 = solve(-mid2);
        if(result1 < result2){
            ans = min(ans, result1);
            hi = mid2;
        }
        else{
            ans = min(ans, result2);
            lo = mid1;
        }
    }
    printf("%lld\n", ans);
}

Compilation message

simfonija.cpp: In function 'int main()':
simfonija.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~
simfonija.cpp:20:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=n;i++) scanf("%d", &a[i]);
                           ~~~~~^~~~~~~~~~~~~
simfonija.cpp:21:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=n;i++) scanf("%d", &b[i]);
                           ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 1916 KB Output is correct
2 Correct 97 ms 1912 KB Output is correct
3 Correct 98 ms 1912 KB Output is correct

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 1920 KB Output is correct
2 Correct 114 ms 1912 KB Output is correct
3 Correct 95 ms 1920 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 1916 KB Output is correct
2 Correct 95 ms 1920 KB Output is correct
3 Correct 94 ms 1912 KB Output is correct

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 1924 KB Output is correct
2 Incorrect 143 ms 1928 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 2012 KB Output is correct
2 Correct 186 ms 1928 KB Output is correct
3 Incorrect 208 ms 1884 KB Output isn't correct

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 169 ms 2040 KB Output is correct
2 Incorrect 116 ms 1920 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 171 ms 1984 KB Output is correct
2 Correct 129 ms 1868 KB Output is correct
3 Correct 169 ms 1932 KB Output is correct

Subtask #9
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 1920 KB Output is correct
2 Correct 213 ms 1916 KB Output is correct
3 Correct 98 ms 1940 KB Output is correct

Subtask #10
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 1920 KB Output is correct
2 Correct 109 ms 1928 KB Output is correct
3 Correct 166 ms 1920 KB Output is correct