oj.uz

Submission #275687

# Submission time Handle Problem Language Result Execution time Memory
275687 2020-08-20T07:06:22 Z 문홍윤(#5111) Radio (Balkan15_RADIO) C++17
0 / 100
 5 ms 256 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define svec(x) sort(x.begin(), x.end())
#define press(x) x.erase(unique(x.begin(), x.end()), x.end())
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
const LL llinf=2e18;
const int inf=1e9;

int n, k;
LL x[20], p[20], s[20], ans[50], anss=llinf;
vector<pli> use;
vector<LL> vc;
bool ch[20];

LL solve(){
    LL ret=llinf;
    use.clear(); vc.clear();
    for(int i=1; i<=n; i++){
        if(!ch[i])continue;
        use.eb(x[i]-p[i], -1);
        use.eb(x[i]+p[i], 1);
        vc.eb(x[i]-p[i]);
        vc.eb(x[i]+p[i]);
    }
    svec(use);
    svec(vc); press(vc);
    LL num=0, sum=0;
    int pv=0;
    for(int i=0; i<vc.size(); i++){
        for(; pv<use.size(); pv++){
            if(use[pv].F>vc[i])break;
            if(use[pv].S==1)num++, sum+=use[pv].F;
        }
        ans[i]=num*vc[i]-sum;
    }
    num=sum=0;
    pv=use.size()-1;
    for(int i=vc.size()-1; i>=0; i--){
        for(; pv>=0; pv--){
            if(use[pv].F<vc[i])break;
            if(use[pv].S==-1)num++, sum+=use[pv].F;
        }
        ans[i]+=sum-num*vc[i];
    }
    for(int i=0; i<vc.size(); i++)ret=min(ret, ans[i]);
    return ret;
}

int main(){
    scanf("%d %d", &n, &k);
    for(int i=1; i<=n; i++){
        scanf("%lld %lld %lld", &x[i], &p[i], &s[i]);
    }
    for(int i=1; i<(1<<n); i++){
        int bc=__builtin_popcount(i);
        if(bc!=k)continue;
        LL temp=0;
        memset(ch, 0, sizeof ch);
        for(int j=0; j<n; j++){
            if(i&(1<<j))ch[j+1]=true;
            else temp-=s[j+1];
        }
        temp+=solve();
        anss=min(anss, temp);
    }
    printf("%lld", anss);
}

Compilation message

radio.cpp: In function 'LL solve()':
radio.cpp:38:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for(int i=0; i<vc.size(); i++){
      |                  ~^~~~~~~~~~
radio.cpp:39:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for(; pv<use.size(); pv++){
      |               ~~^~~~~~~~~~~
radio.cpp:54:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(int i=0; i<vc.size(); i++)ret=min(ret, ans[i]);
      |                  ~^~~~~~~~~~
radio.cpp: In function 'int main()':
radio.cpp:59:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   59 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
radio.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   61 |         scanf("%lld %lld %lld", &x[i], &p[i], &s[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Incorrect 0 ms 256 KB Output isn't correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Incorrect 0 ms 256 KB Output isn't correct