oj.uz

답안 #982323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
982323 2024-05-14T06:35:55 Z irmuun Vision Program (IOI19_vision) C++17
8 / 100
 2 ms 1116 KB 
#include<bits/stdc++.h>
#include "vision.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

void construct_network(int H,int W,int K){
    vector<array<int,3>>C;
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            C.pb({i,j,i*W+j});
        }
    }
    int cur=H*W;
    vector<int>Ns;
    for(int i=0;i<1;i++){
        vector<int>ask;
        for(int j=0;j<C.size();j++){
            if(abs(C[i][0]-C[j][0])+abs(C[i][1]-C[j][1])==K){
                ask.pb(C[j][2]);
            }
        }
        if(!ask.empty()){
            add_or(ask);
            add_and({cur,C[i][2]});
            Ns.pb(cur+1);
            cur+=2;
        }
    }
    add_or(Ns);
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:24:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         for(int j=0;j<C.size();j++){
      |                     ~^~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 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 348 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 348 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 348 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 348 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 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 500 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 564 KB Output is correct
10 Correct 0 ms 564 KB Output is correct
11 Correct 1 ms 564 KB Output is correct
12 Correct 0 ms 564 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 440 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 800 KB Output is correct
21 Correct 1 ms 800 KB Output is correct
22 Correct 1 ms 800 KB Output is correct
23 Correct 1 ms 800 KB Output is correct
24 Correct 1 ms 796 KB Output is correct
25 Correct 1 ms 796 KB Output is correct
26 Correct 1 ms 996 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 2 ms 1116 KB Output is correct
31 Correct 2 ms 1116 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 1112 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 348 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -