oj.uz

답안 #430198

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
430198 2021-06-16T12:01:38 Z MOUF_MAHMALAT Vision Program (IOI19_vision) C++14
0 / 100
 376 ms 25692 KB 
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
vector<ll>v;
ll n,m,gg,x,y;
bool b[200][200][200][200];
void construct_network(int H, int W, int k)
{
    n=H,m=W,gg=n*m;
    for(ll i=0; i<n; i++)
    {
        if(i==16||i==17||i==2)
            continue;
        for(ll j=0; j<m; j++)
        {
            for(ll o=0; o<n; o++)
                for(ll p=0; p<m; p++)
                {
                    if(abs(i-o)+abs(j-p)!=k)
                        continue;
                    if(b[i][j][o][p])
                        continue;
                    b[i][j][o][p]=b[o][p][i][j]=1;
                    x=(i*m)+j,y=(o*m)+p;
                    add_and({x,y});
                    v.push_back(gg++);
                }
        }
    }
    add_or(v);
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 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 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Incorrect 1 ms 332 KB on inputs (2, 0), (2, 1), expected 1, but computed 0
11 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 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 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Incorrect 1 ms 332 KB on inputs (2, 0), (2, 1), expected 1, but computed 0
11 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 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 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Incorrect 1 ms 332 KB on inputs (2, 0), (2, 1), expected 1, but computed 0
11 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 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 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Incorrect 1 ms 332 KB on inputs (2, 0), (2, 1), expected 1, but computed 0
11 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1100 KB Output is correct
2 Correct 2 ms 1100 KB Output is correct
3 Correct 2 ms 1100 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 1996 KB Output is correct
6 Correct 3 ms 2216 KB Output is correct
7 Correct 2 ms 1356 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 2 ms 1100 KB Output is correct
13 Correct 1 ms 716 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Incorrect 2 ms 1868 KB on inputs (16, 0), (17, 0), expected 1, but computed 0
16 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 38 ms 14200 KB Output is correct
4 Incorrect 14 ms 9240 KB WA in grader: Too many instructions
5 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 376 ms 25692 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 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 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Incorrect 1 ms 332 KB on inputs (2, 0), (2, 1), expected 1, but computed 0
11 Halted 0 ms 0 KB -