oj.uz

Submission #147912

# Submission time Handle Problem Language Result Execution time Memory
147912 2019-08-31T06:51:06 Z starwh03 None (KOI17_civilization) C++14
19 / 100
 4 ms 504 KB 
#include<bits/stdc++.h>
using namespace std;
int miku[2100];
int in[2100][2];

struct s
{
    int d,a,b;
    bool operator<(s a){return a.d>d;}
};

vector<s> cone;

int uni(int i){return miku[i]<0?i:miku[i]=uni(miku[i]);}

int dis(int a,int b){return abs(in[a][0]-in[b][0])+abs(in[a][1]-in[b][1]);}

int main()
{
    int n,m,mini=0;
    cin>>n>>m;
    for(int i=0;i<m;i++)cin>>in[i][0]>>in[i][1],miku[i]=-i-1;
    for(int i=0;i<m;i++)for(int j=i+1;j<m;j++)cone.push_back({dis(i,j),i,j});
    sort(cone.begin(),cone.end());
    for(int i=0;i<cone.size();i++)
        if(uni(cone[i].a)!=uni(cone[i].b))mini=cone[i].d,miku[uni(cone[i].a)]=uni(cone[i].b);
    cout<<mini/2;
    return 0;
}

Compilation message

civilization.cpp: In function 'int main()':
civilization.cpp:25:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<cone.size();i++)
                 ~^~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 1 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 256 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 1 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Runtime error 4 ms 496 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Halted 0 ms 0 KB -

Subtask #3
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 1 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Runtime error 4 ms 496 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Halted 0 ms 0 KB -