oj.uz

Submission #793528

# Submission time Handle Problem Language Result Execution time Memory
793528 2023-07-25T23:36:44 Z fuad27 Road Construction (JOI21_road_construction) C++17
5 / 100
 10000 ms 5192 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
void solve() {
  int n, k;
  cin >> n >> k;
  int x[n], y[n];
  priority_queue<unsigned int> pq;
  for(int i = 0;i<n;i++) {
    cin >> x[i] >> y[i];

  }
  for(int i = 0;i<n;i++)
    for(int j = i+1;j<n;j++){
      pq.push((unsigned int)abs(x[i]-x[j])+abs(y[i]-y[j]));
      while(pq.size()>k) {
        pq.pop();
      }
    }
  vector<unsigned int> v;
  while(pq.size()){
    v.push_back(pq.top());
    pq.pop();
  }
  for(int i=v.size()-1;i>=0;i--)cout << v[i] << "\n";
}
int main () {
  cin.tie(0)->sync_with_stdio(0);
  int t=1;
  while(t--)solve();
  return 0;
}

Compilation message

road_construction.cpp: In function 'void solve()':
road_construction.cpp:17:22: warning: comparison of integer expressions of different signedness: 'std::priority_queue<unsigned int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   17 |       while(pq.size()>k) {
      |             ~~~~~~~~~^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 4940 KB Output is correct
2 Correct 71 ms 5004 KB Output is correct
3 Correct 46 ms 5020 KB Output is correct
4 Correct 45 ms 5192 KB Output is correct
5 Correct 65 ms 3872 KB Output is correct
6 Correct 19 ms 332 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Execution timed out 10048 ms 3416 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 10028 ms 2260 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 10028 ms 2260 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 4940 KB Output is correct
2 Correct 71 ms 5004 KB Output is correct
3 Correct 46 ms 5020 KB Output is correct
4 Correct 45 ms 5192 KB Output is correct
5 Correct 65 ms 3872 KB Output is correct
6 Correct 19 ms 332 KB Output is correct
7 Execution timed out 10044 ms 2300 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 4940 KB Output is correct
2 Correct 71 ms 5004 KB Output is correct
3 Correct 46 ms 5020 KB Output is correct
4 Correct 45 ms 5192 KB Output is correct
5 Correct 65 ms 3872 KB Output is correct
6 Correct 19 ms 332 KB Output is correct
7 Execution timed out 10048 ms 3416 KB Time limit exceeded
8 Halted 0 ms 0 KB -