oj.uz

Submission #427282

# Submission time Handle Problem Language Result Execution time Memory
427282 2021-06-14T13:55:20 Z model_code Power plants (CPSPC17_power) C++17
35 / 100
 5000 ms 1124 KB 
// Slow solution - O(n^2) with no logs, 35/100

#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;

typedef long long LL;

const int maxn = 200200;

struct point
{
    int x, y;
};

LL dist(point p1, point p2)
{
    LL x = p1.x - p2.x;
    LL y = p1.y - p2.y;
    return x*x + y*y;
}

typedef pair<int,int> PI;

point P[maxn];

vector<vector<int>> G;
vector<int> col;


bool dfs(int x)
{
    bool ok = true;
    for(int y : G[x])
    {
        if (col[y]==col[x])
            return false;
        if (col[y]==-1)
        {
            col[y] = !col[x];
            ok &= dfs(y);
            if (!ok)
                return false;
        }
    }
    return ok;
}

bool check(int n, vector<PI> &v, int s)
{
    col.clear();
    col.resize(n,-1);
    G.clear();
    G.resize(n);
    for(int i=0; i<s; i++)
    {
        G[v[i].first].push_back(v[i].second);
        G[v[i].second].push_back(v[i].first);
    }
    bool ok = true;
    for(int i=0; i<n; i++)
        if (col[i]==-1)
        {
            col[i] = 0;
            ok &= dfs(i);
        }
    return ok;
}



int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0; i<n; i++)
        scanf("%d %d",&P[i].x, &P[i].y);
    vector<PI> v;
    for(int i=0; i<n; i++)
    {   vector<bool> used(n,false);
        for(int k=0; k<min(n-1,6); k++)
        {
            int b = -1;
            for(int j=0; j<n; j++)
                if (j!=i && !used[j] && (b==-1 || dist(P[i],P[j])<dist(P[i],P[b])))
                    b = j;
            used[b] = true;
            v.push_back(PI(i,b));
        }
    }
    fprintf(stderr,"%d\n",(int)v.size());
    sort(v.begin(),v.end(), [] (PI a, PI b) {return dist(P[a.first],P[a.second])<dist(P[b.first],P[b.second]); });
    LL p = 0;
    LL q = v.size()-1;
    while(p<q)
    {
        int s = (p+q+1)/2;
        if (check(n,v,s))
            p = s;
        else
            q = s-1;
    }
    check(n,v,p);
    vector<int> R[2];
    for(int i=0; i<n; i++)
        R[col[i]].push_back(i);
    
    printf("%Ld\n",dist(P[v[p].first],P[v[p].second]));
    for(int h=0; h<2; h++)
    {
        printf("%d\n",(int)R[h].size());
        for(int i=0; i<(int)R[h].size(); i++)
            printf((i ? " %d" : "%d"),R[h][i]+1);
        printf("\n");
    }
    
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:77:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
Main.cpp:79:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |         scanf("%d %d",&P[i].x, &P[i].y);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 224 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 224 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 168 ms 524 KB Output is correct
11 Correct 142 ms 488 KB Output is correct
12 Correct 212 ms 448 KB Output is correct
13 Correct 153 ms 516 KB Output is correct
14 Correct 205 ms 560 KB Output is correct
15 Correct 152 ms 572 KB Output is correct
16 Correct 213 ms 536 KB Output is correct
17 Correct 181 ms 524 KB Output is correct
18 Correct 171 ms 640 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 224 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 168 ms 524 KB Output is correct
11 Correct 142 ms 488 KB Output is correct
12 Correct 212 ms 448 KB Output is correct
13 Correct 153 ms 516 KB Output is correct
14 Correct 205 ms 560 KB Output is correct
15 Correct 152 ms 572 KB Output is correct
16 Correct 213 ms 536 KB Output is correct
17 Correct 181 ms 524 KB Output is correct
18 Correct 171 ms 640 KB Output is correct
19 Execution timed out 5046 ms 1124 KB Time limit exceeded
20 Halted 0 ms 0 KB -