oj.uz

Submission #494741

# Submission time Handle Problem Language Result Execution time Memory
494741 2021-12-16T04:59:44 Z Khizri Fountain Parks (IOI21_parks) C++17
5 / 100
 117 ms 17832 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define F first
#define S second
#define pii pair<int,int>
const int mxn=2e5+5;
int n,color[10][mxn],arr[10][mxn],say,cl[10][mxn];
int l[4]={0,0,2,-2};
int r[4]={2,-2,0,0};
vector<int>a,b,c,d;
void bfs(int x,int y){
    queue<pii>q;
    q.push({x,y});
    color[x][y]=1;
    while(q.size()){
        pii p=q.front();
        q.pop();
        x=p.F,y=p.S;
        say++;
        for(int i=0;i<4;i++){
            int u=x+l[i],v=y+r[i];
            if(arr[u][v]&&!color[u][v]){
                a.pb(arr[x][y]-1);
                b.pb(arr[u][v]-1);
                int q1=x-1,q2=v-1;
                if(x!=u){
                    q1=(x+u)/2;
                    if(cl[q1][q2]){
                        q2+=2;
                    }
                }
                else{
                    q2=(y+v)/2;
                    if(cl[q1][q2]){
                        q1+=2;
                    }
                }
                cl[q1][q2]=1;
                c.pb(q1);
                d.pb(q2);
                q.push({u,v});
                color[u][v]=1;
            }
        }
    }
}
int construct_roads(vector<int> x, vector<int> y) {
    n=x.size();
    int pos1=1e7,pos=1e7;
    for(int i=0;i<n;i++){
        pos1=min(pos1,x[i]);
        pos=min(pos,y[i]);
        arr[x[i]][y[i]]=i+1;
    }
    bfs(pos1,pos);
    if(say==n){
        build(a,b,c,d);
        return 1;
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 51 ms 9092 KB Output is correct
10 Correct 5 ms 1356 KB Output is correct
11 Correct 28 ms 5080 KB Output is correct
12 Correct 12 ms 1896 KB Output is correct
13 Correct 8 ms 2508 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 52 ms 9032 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 51 ms 9092 KB Output is correct
10 Correct 5 ms 1356 KB Output is correct
11 Correct 28 ms 5080 KB Output is correct
12 Correct 12 ms 1896 KB Output is correct
13 Correct 8 ms 2508 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 52 ms 9032 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 117 ms 17712 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 448 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 40 ms 7468 KB Output is correct
29 Correct 67 ms 10876 KB Output is correct
30 Correct 80 ms 14396 KB Output is correct
31 Correct 104 ms 17832 KB Output is correct
32 Correct 1 ms 292 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 1 ms 304 KB Output is correct
39 Correct 1 ms 284 KB Output is correct
40 Incorrect 0 ms 332 KB Solution announced impossible, but it is possible.
41 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 51 ms 9092 KB Output is correct
10 Correct 5 ms 1356 KB Output is correct
11 Correct 28 ms 5080 KB Output is correct
12 Correct 12 ms 1896 KB Output is correct
13 Correct 8 ms 2508 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 52 ms 9032 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 117 ms 17712 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 448 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 40 ms 7468 KB Output is correct
29 Correct 67 ms 10876 KB Output is correct
30 Correct 80 ms 14396 KB Output is correct
31 Correct 104 ms 17832 KB Output is correct
32 Correct 1 ms 292 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 1 ms 304 KB Output is correct
39 Correct 1 ms 284 KB Output is correct
40 Incorrect 0 ms 332 KB Solution announced impossible, but it is possible.
41 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 51 ms 9092 KB Output is correct
10 Correct 5 ms 1356 KB Output is correct
11 Correct 28 ms 5080 KB Output is correct
12 Correct 12 ms 1896 KB Output is correct
13 Correct 8 ms 2508 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 52 ms 9032 KB Output is correct
17 Runtime error 1 ms 340 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 51 ms 9092 KB Output is correct
10 Correct 5 ms 1356 KB Output is correct
11 Correct 28 ms 5080 KB Output is correct
12 Correct 12 ms 1896 KB Output is correct
13 Correct 8 ms 2508 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 52 ms 9032 KB Output is correct
17 Runtime error 43 ms 6732 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 51 ms 9092 KB Output is correct
10 Correct 5 ms 1356 KB Output is correct
11 Correct 28 ms 5080 KB Output is correct
12 Correct 12 ms 1896 KB Output is correct
13 Correct 8 ms 2508 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 52 ms 9032 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 117 ms 17712 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 448 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 40 ms 7468 KB Output is correct
29 Correct 67 ms 10876 KB Output is correct
30 Correct 80 ms 14396 KB Output is correct
31 Correct 104 ms 17832 KB Output is correct
32 Correct 1 ms 292 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 1 ms 304 KB Output is correct
39 Correct 1 ms 284 KB Output is correct
40 Incorrect 0 ms 332 KB Solution announced impossible, but it is possible.
41 Halted 0 ms 0 KB -