Submission #1268263

#	Time	Username	Problem	Language	Result	Execution time	Memory
1268263		julia_08	Advertisement 2 (JOI23_ho_t2)	C++20	23 / 100	13 ms	436 KiB

Main

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 20;

int x[MAXN], e[MAXN];

int marc[MAXN];

int main(){
  cin.tie(0)->sync_with_stdio(0);

  int n; cin >> n;

  for(int i=0; i<n; i++) cin >> x[i] >> e[i];
    
  int ans = n;

  for(int mask=0; mask<(1 << n); mask++){

    for(int i=0; i<n; i++) marc[i] = 0;

    for(int i=0; i<n; i++){
      if(mask & (1 << i)){
        for(int j=0; j<n; j++){
          if(abs(x[i] - x[j]) <= e[i] - e[j]){
            marc[j] = 1;
          }
        }
      }
    }

    int cnt = 0;

    for(int i=0; i<n; i++) if(marc[i]) cnt ++;

    if(cnt == n) ans = min(ans, __builtin_popcount(mask));

  } 

  cout << ans << "\n";

  return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 23 / 23
• Subtask 3: 0 / 36
• Subtask 4: 0 / 31