oj.uz

답안 #494744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
494744 2021-12-16T05:04:54 Z Khizri 분수 공원 (IOI21_parks) C++17
5 / 100
 100 ms 17716 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 48 ms 9056 KB Output is correct
10 Correct 5 ms 1356 KB Output is correct
11 Correct 26 ms 5060 KB Output is correct
12 Correct 7 ms 1868 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 48 ms 9012 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 48 ms 9056 KB Output is correct
10 Correct 5 ms 1356 KB Output is correct
11 Correct 26 ms 5060 KB Output is correct
12 Correct 7 ms 1868 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 48 ms 9012 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 100 ms 17716 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 1 ms 480 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 39 ms 7348 KB Output is correct
29 Correct 79 ms 10832 KB Output is correct
30 Correct 78 ms 14208 KB Output is correct
31 Correct 99 ms 17652 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Incorrect 0 ms 332 KB Integer parameter [name=u[j]] equals to -1, violates the range [0, 1]
37 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 48 ms 9056 KB Output is correct
10 Correct 5 ms 1356 KB Output is correct
11 Correct 26 ms 5060 KB Output is correct
12 Correct 7 ms 1868 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 48 ms 9012 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 100 ms 17716 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 1 ms 480 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 39 ms 7348 KB Output is correct
29 Correct 79 ms 10832 KB Output is correct
30 Correct 78 ms 14208 KB Output is correct
31 Correct 99 ms 17652 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Incorrect 0 ms 332 KB Integer parameter [name=u[j]] equals to -1, violates the range [0, 1]
37 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 48 ms 9056 KB Output is correct
10 Correct 5 ms 1356 KB Output is correct
11 Correct 26 ms 5060 KB Output is correct
12 Correct 7 ms 1868 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 48 ms 9012 KB Output is correct
17 Runtime error 2 ms 332 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 48 ms 9056 KB Output is correct
10 Correct 5 ms 1356 KB Output is correct
11 Correct 26 ms 5060 KB Output is correct
12 Correct 7 ms 1868 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 48 ms 9012 KB Output is correct
17 Runtime error 38 ms 6732 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 48 ms 9056 KB Output is correct
10 Correct 5 ms 1356 KB Output is correct
11 Correct 26 ms 5060 KB Output is correct
12 Correct 7 ms 1868 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 48 ms 9012 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 100 ms 17716 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 1 ms 480 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 39 ms 7348 KB Output is correct
29 Correct 79 ms 10832 KB Output is correct
30 Correct 78 ms 14208 KB Output is correct
31 Correct 99 ms 17652 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Incorrect 0 ms 332 KB Integer parameter [name=u[j]] equals to -1, violates the range [0, 1]
37 Halted 0 ms 0 KB -