oj.uz

Submission #992340

# Submission time Handle Problem Language Result Execution time Memory
992340 2024-06-04T09:41:57 Z PVM_pvm Road Construction (JOI21_road_construction) C++17
6 / 100
 807 ms 5704 KB 
#include<bits/stdc++.h>
using namespace std;
#define MAXN 250007
struct point
{
    int x,y;
} arr[MAXN];
int n,k;
bool cmp1(point &a, point &b)
{
    if (a.x!=b.x) return a.x<b.x;
    return a.y<b.y;
}
bool cmp2(point &a, point &b)
{
    return a.y<b.y;
}
int dist(int a, int b)
{
    int xx=arr[a].x-arr[b].x;
    if (xx<0) xx*=-1;
    int yy=arr[a].y-arr[b].y;
    if (yy<0) yy*=-1;
    return xx+yy;
}
priority_queue<int> qu;
    int BSIZE=1000;
void check()
{
    for (int q=0;q<n;q++)
    {
        for (int w=1;w<=BSIZE;w++)
        {
            if (q-w<0) break;
            int dst=dist(q,q-w);
            if (qu.size()<k) qu.push(dst);
            else
            {
                if (dst<qu.top())
                {
                    qu.pop();
                    qu.push(dst);
                }
            }
        }
    }
}
int main()
{
    cin>>n>>k;
    for (int q=0;q<n;q++) cin>>arr[q].x>>arr[q].y;
    sort(arr,arr+n,cmp1);
    check();
    //sort(arr,arr+n,cmp2);
    //check();
    vector<int> vv;
    while (!qu.empty())
    {
        vv.push_back(qu.top());
        qu.pop();
    }
    reverse(vv.begin(),vv.end());
    for (int q=0;q<vv.size();q++) cout<<vv[q]<<"\n";
}

Compilation message

road_construction.cpp: In function 'void check()':
road_construction.cpp:36:26: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |             if (qu.size()<k) qu.push(dst);
      |                 ~~~~~~~~~^~
road_construction.cpp: In function 'int main()':
road_construction.cpp:63:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for (int q=0;q<vv.size();q++) cout<<vv[q]<<"\n";
      |                  ~^~~~~~~~~~

Subtask #1
0 / 5.0

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

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 793 ms 5700 KB Output is correct
2 Correct 807 ms 5592 KB Output is correct
3 Correct 42 ms 4936 KB Output is correct
4 Correct 747 ms 5468 KB Output is correct
5 Correct 752 ms 5600 KB Output is correct
6 Correct 669 ms 5704 KB Output is correct
7 Correct 709 ms 4904 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 633 ms 2172 KB Output is correct
2 Correct 639 ms 2368 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 633 ms 2172 KB Output is correct
2 Correct 639 ms 2368 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

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

Subtask #6
0 / 35.0

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