oj.uz

답안 #296488

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
296488 2020-09-10T15:15:51 Z humbertoyusta Vision Program (IOI19_vision) C++14
8 / 100
 1 ms 384 KB 
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
#define db(x) cerr << #x << ": " << (x) << '\n';
#define f first
#define s second
#define pb push_back
#define ii pair<int,int>

void construct_network(int H, int W, int K) {

    if( max(W,H) <= 30 || min(W,H) == 1 ){

        vector<ii> v;
        for(int i=0; i<H; i++)
            for(int j=0; j<W; j++)
                for(int k=0; k<H; k++)
                    for(int l=0; l<W; l++)
                        if( abs(l - j) + abs(k - i) == K )
                            if( k >= j ) v.pb({i*W+j,k*W+l});

        for( auto i : v ){
            vector<int> N;
            N.pb(i.f);
            N.pb(i.s);
            add_and(N);
        }

        vector<int> vx;
        for(int i=W*H; i<W*H+v.size(); i++)
            vx.pb(i);
        add_or(vx);

    }
    else{

        vector<ii> v;
        for(int i=0; i<1; i++)
            for(int j=0; j<1; j++)
                for(int k=0; k<H; k++)
                    for(int l=0; l<W; l++)
                        if( abs(l - j) + abs(k - i) == K )
                            v.pb({i*W+j,k*W+l});

        for( auto i : v ){
            vector<int> N;
            N.pb(i.f);
            N.pb(i.s);
            add_and(N);
        }

        vector<int> vx;
        for(int i=W*H; i<W*H+v.size(); i++)
            vx.pb(i);
        add_or(vx);

    }
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:30:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         for(int i=W*H; i<W*H+v.size(); i++)
      |                        ~^~~~~~~~~~~~~
vision.cpp:53:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         for(int i=W*H; i<W*H+v.size(); i++)
      |                        ~^~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 288 KB Output is correct

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB on inputs (80, 199), (81, 199), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -