Submission #1074910

#	Time	Username	Problem	Language	Result	Execution time	Memory
1074910		bleahbleah	Closing Time (IOI23_closing)	C++17	0 / 100	1042 ms	32848 KiB

closing

#include "closing.h"

#include <vector>
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;

const int nmax = 2e5 + 5;

ll dx[nmax], dy[nmax];
int p[nmax];
vector<pii> g[nmax];

void filld(int node, int f, ll *d) {
   p[node] = f;
   cerr << node << ' ' << f << '\n';
   for(auto [x, c] : g[node]) {
      if(x == f) continue;
      d[x] = d[node] + c;
      filld(x, node, d);
   }
   return;
}

int separate(int N, ll S) {
   vector<pii> s;
   for(int i = 0; i < N; i++) {
      s.emplace_back(i, 1);
      s.emplace_back(i, 2);
   }
   sort(all(s), [&](auto a, auto b) {
      a.first = (a.second == 1? dx[a.first] : dy[a.first]);
      b.first = (b.second == 1? dx[b.first] : dy[b.first]);
      return a.first < b.first;
   });
   
   vector<int> occ(N, 0);
   int cnt = 0;
   for(auto [x, t] : s) {
      if(occ[x]) continue;
      x = (t == 1? dx[x] : dy[x]);
      if(S < x) break;
      S -= x;
      occ[x] = 1;
      cnt++;
   }
   
   return cnt;
}



int max_score(int N, int X, int Y, long long S, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
   //for(int i = 0; i <= N; i++) g[i].clear();
   
   for(int i = 0; i < sz(U); i++) {
      g[U[i]].emplace_back(V[i], W[i]);
      g[V[i]].emplace_back(U[i], W[i]);
   }
   
   filld(X, X, dx);
   filld(Y, Y, dy);
   
   int opt1 = separate(N, S);
   return opt1;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 9
• Subtask 6: 0 / 11
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 17