oj.uz

답안 #494750

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
494750 2021-12-16T05:14:43 Z Khizri 분수 공원 (IOI21_parks) C++17
5 / 100
 83 ms 23088 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+100;
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){
    say=0;
    memset(color,0,sizeof(color));
    memset(cl,0,sizeof(cl));
    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 a1=-1e7,b1=-1e7,a2=1e7,b2=1e7;
    for(int i=0;i<n;i++){
        a1=max(a1,x[i]);
        b1=max(b1,y[i]);
        a2=min(a2,x[i]);
        b2=min(b2,y[i]);
        arr[x[i]][y[i]]=i+1;
    }
    bfs(a1,b1);
    if(say==n){
        build(a,b,c,d);
        return 1;
    }
    bfs(a2,b2);
    if(say==n){
        build(a,b,c,d);
        return 1;
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 15948 KB Output is correct
2 Correct 6 ms 15948 KB Output is correct
3 Correct 8 ms 15948 KB Output is correct
4 Correct 6 ms 15948 KB Output is correct
5 Correct 7 ms 15948 KB Output is correct
6 Correct 8 ms 15868 KB Output is correct
7 Correct 8 ms 15948 KB Output is correct
8 Correct 8 ms 15948 KB Output is correct
9 Correct 59 ms 23088 KB Output is correct
10 Correct 12 ms 16844 KB Output is correct
11 Correct 36 ms 19860 KB Output is correct
12 Correct 14 ms 17228 KB Output is correct
13 Correct 18 ms 17868 KB Output is correct
14 Correct 8 ms 15948 KB Output is correct
15 Correct 12 ms 16076 KB Output is correct
16 Correct 83 ms 23080 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 15948 KB Output is correct
2 Correct 6 ms 15948 KB Output is correct
3 Correct 8 ms 15948 KB Output is correct
4 Correct 6 ms 15948 KB Output is correct
5 Correct 7 ms 15948 KB Output is correct
6 Correct 8 ms 15868 KB Output is correct
7 Correct 8 ms 15948 KB Output is correct
8 Correct 8 ms 15948 KB Output is correct
9 Correct 59 ms 23088 KB Output is correct
10 Correct 12 ms 16844 KB Output is correct
11 Correct 36 ms 19860 KB Output is correct
12 Correct 14 ms 17228 KB Output is correct
13 Correct 18 ms 17868 KB Output is correct
14 Correct 8 ms 15948 KB Output is correct
15 Correct 12 ms 16076 KB Output is correct
16 Correct 83 ms 23080 KB Output is correct
17 Correct 7 ms 15948 KB Output is correct
18 Correct 7 ms 15948 KB Output is correct
19 Incorrect 7 ms 15872 KB Tree @(3, 5) appears more than once: for edges on positions 0 and 3
20 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 15948 KB Output is correct
2 Correct 6 ms 15948 KB Output is correct
3 Correct 8 ms 15948 KB Output is correct
4 Correct 6 ms 15948 KB Output is correct
5 Correct 7 ms 15948 KB Output is correct
6 Correct 8 ms 15868 KB Output is correct
7 Correct 8 ms 15948 KB Output is correct
8 Correct 8 ms 15948 KB Output is correct
9 Correct 59 ms 23088 KB Output is correct
10 Correct 12 ms 16844 KB Output is correct
11 Correct 36 ms 19860 KB Output is correct
12 Correct 14 ms 17228 KB Output is correct
13 Correct 18 ms 17868 KB Output is correct
14 Correct 8 ms 15948 KB Output is correct
15 Correct 12 ms 16076 KB Output is correct
16 Correct 83 ms 23080 KB Output is correct
17 Correct 7 ms 15948 KB Output is correct
18 Correct 7 ms 15948 KB Output is correct
19 Incorrect 7 ms 15872 KB Tree @(3, 5) appears more than once: for edges on positions 0 and 3
20 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 15948 KB Output is correct
2 Correct 6 ms 15948 KB Output is correct
3 Correct 8 ms 15948 KB Output is correct
4 Correct 6 ms 15948 KB Output is correct
5 Correct 7 ms 15948 KB Output is correct
6 Correct 8 ms 15868 KB Output is correct
7 Correct 8 ms 15948 KB Output is correct
8 Correct 8 ms 15948 KB Output is correct
9 Correct 59 ms 23088 KB Output is correct
10 Correct 12 ms 16844 KB Output is correct
11 Correct 36 ms 19860 KB Output is correct
12 Correct 14 ms 17228 KB Output is correct
13 Correct 18 ms 17868 KB Output is correct
14 Correct 8 ms 15948 KB Output is correct
15 Correct 12 ms 16076 KB Output is correct
16 Correct 83 ms 23080 KB Output is correct
17 Runtime error 1 ms 332 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 15948 KB Output is correct
2 Correct 6 ms 15948 KB Output is correct
3 Correct 8 ms 15948 KB Output is correct
4 Correct 6 ms 15948 KB Output is correct
5 Correct 7 ms 15948 KB Output is correct
6 Correct 8 ms 15868 KB Output is correct
7 Correct 8 ms 15948 KB Output is correct
8 Correct 8 ms 15948 KB Output is correct
9 Correct 59 ms 23088 KB Output is correct
10 Correct 12 ms 16844 KB Output is correct
11 Correct 36 ms 19860 KB Output is correct
12 Correct 14 ms 17228 KB Output is correct
13 Correct 18 ms 17868 KB Output is correct
14 Correct 8 ms 15948 KB Output is correct
15 Correct 12 ms 16076 KB Output is correct
16 Correct 83 ms 23080 KB Output is correct
17 Runtime error 52 ms 6724 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 15948 KB Output is correct
2 Correct 6 ms 15948 KB Output is correct
3 Correct 8 ms 15948 KB Output is correct
4 Correct 6 ms 15948 KB Output is correct
5 Correct 7 ms 15948 KB Output is correct
6 Correct 8 ms 15868 KB Output is correct
7 Correct 8 ms 15948 KB Output is correct
8 Correct 8 ms 15948 KB Output is correct
9 Correct 59 ms 23088 KB Output is correct
10 Correct 12 ms 16844 KB Output is correct
11 Correct 36 ms 19860 KB Output is correct
12 Correct 14 ms 17228 KB Output is correct
13 Correct 18 ms 17868 KB Output is correct
14 Correct 8 ms 15948 KB Output is correct
15 Correct 12 ms 16076 KB Output is correct
16 Correct 83 ms 23080 KB Output is correct
17 Correct 7 ms 15948 KB Output is correct
18 Correct 7 ms 15948 KB Output is correct
19 Incorrect 7 ms 15872 KB Tree @(3, 5) appears more than once: for edges on positions 0 and 3
20 Halted 0 ms 0 KB -