oj.uz

Submission #557428

# Submission time Handle Problem Language Result Execution time Memory
557428 2022-05-05T10:24:42 Z 600Mihnea Road Construction (JOI21_road_construction) C++17
5 / 100
 10000 ms 5060 KB 
#include <bits/stdc++.h>

bool home = 1;

using namespace std;

typedef long long ll;
const int N=250000+7;

struct T{
  ll x;
  ll y;
};

bool cmpTx(T a,T b) {
  return a.x<b.x;
}

int n;
int k;
T a[N];

ll how_many_under(ll d) {
  ll sol=0;
  int pt=1;
  for (int i=1;i<=n;i++) {
    while (a[i].x-a[pt].x>d) pt++;

    for (int j=pt;j<i;j++) {
      if(abs(a[i].y-a[j].y)<=d){
        sol++;
      }
    }
  }
  return sol;
}

signed main() {
#ifdef ONLINE_JUDGE
  home = 0;
#endif

  home=0;

  if (home) {
    freopen("I_am_iron_man", "r", stdin);
  }
  else {
    ios::sync_with_stdio(0); cin.tie(0);
  }

  cin>>n>>k;

  for (int i=1;i<=n;i++) {
    int x,y;
    cin>>x>>y;
    a[i]={x+y, x-y};
  }

  sort(a+1,a+n+1,cmpTx);

  ll low=0,high=(ll)1e10,sol=-1;

  while (low<=high) {
    ll mid=(low+high)/2;
    if(how_many_under(mid)<=k) {
      sol=mid;
      low=mid+1;
    }else{
      high=mid-1;
    }
  }
  vector<ll> v;
  int pt=1;
  for (int i=1;i<=n;i++) {
    while (a[i].x-a[pt].x>sol) pt++;

    for (int j=pt;j<i;j++) {

      if(abs(a[i].y-a[j].y)<=sol){
        v.push_back(max(a[i].x-a[j].x,abs(a[i].y-a[j].y)));
      }
    }
  }
  sort(v.begin(),v.end());
  assert((int)v.size()<=k);
  v.resize(k, sol+1);
  for (auto &x: v) {
    cout<<x<<"\n";
  }
}

Compilation message

road_construction.cpp: In function 'int main()':
road_construction.cpp:46:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |     freopen("I_am_iron_man", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 4940 KB Output is correct
2 Correct 55 ms 4920 KB Output is correct
3 Correct 55 ms 5000 KB Output is correct
4 Correct 46 ms 5060 KB Output is correct
5 Correct 49 ms 3820 KB Output is correct
6 Correct 6 ms 340 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Execution timed out 10011 ms 4180 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 10089 ms 4184 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 10089 ms 4184 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 4940 KB Output is correct
2 Correct 55 ms 4920 KB Output is correct
3 Correct 55 ms 5000 KB Output is correct
4 Correct 46 ms 5060 KB Output is correct
5 Correct 49 ms 3820 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Execution timed out 10089 ms 1876 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 4940 KB Output is correct
2 Correct 55 ms 4920 KB Output is correct
3 Correct 55 ms 5000 KB Output is correct
4 Correct 46 ms 5060 KB Output is correct
5 Correct 49 ms 3820 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Execution timed out 10011 ms 4180 KB Time limit exceeded
8 Halted 0 ms 0 KB -