oj.uz

답안 #588006

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
588006 2022-07-02T16:03:32 Z ogibogi2004 Vision Program (IOI19_vision) C++14
0 / 100
 22 ms 1116 KB 
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;

void construct_network(int H, int W, int K) {
    vector<int>table;
    for(int i=0;i<H*W;i++)table.push_back(i);
    vector<int>diag1,diag2;
    for(int s=0;s<H+W-1;s++)
    {
        vector<int>v;
        for(int i=0;i<H;i++)
        {
            for(int j=0;j<W;j++)
            {
                if(i+j==s)v.push_back(i*W+j);
            }
        }
        diag1.push_back(add_or(v));
    }
    for(int s=-(W-1);s<H;s++)
    {
        vector<int>v;
        for(int i=0;i<H;i++)
        {
            for(int j=0;j<W;j++)
            {
                if(i-j==s)v.push_back(i*W+j);
            }
        }
        diag2.push_back(add_or(v));
    }
    return;
    vector<int>distsK,distsMoreThanK;
    for(int i=0;i<diag1.size()-K;i++)
    {
        distsK.push_back(add_and({diag1[i],diag1[i+K]}));
        for(int j=i+K+1;j<diag1.size();j++)
        {
            distsMoreThanK.push_back(add_and({diag1[i],diag1[j]}));
        }
    }
    for(int i=0;i<diag2.size()-K;i++)
    {
        distsK.push_back(add_and({diag2[i],diag2[i+K]}));
        for(int j=i+K+1;j<diag2.size();j++)
        {
            distsMoreThanK.push_back(add_and({diag2[i],diag2[j]}));
        }
    }
    if(distsK.size()==0)
    {
        add_and(table);
        return;
    }
    if(distsMoreThanK.size()==0)
    {
        add_or(distsK);
    }
    add_and({add_not(add_or(distsMoreThanK)),add_or(distsK)});
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:35:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for(int i=0;i<diag1.size()-K;i++)
      |                 ~^~~~~~~~~~~~~~~
vision.cpp:38:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for(int j=i+K+1;j<diag1.size();j++)
      |                         ~^~~~~~~~~~~~~
vision.cpp:43:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for(int i=0;i<diag2.size()-K;i++)
      |                 ~^~~~~~~~~~~~~~~
vision.cpp:46:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for(int j=i+K+1;j<diag2.size();j++)
      |                         ~^~~~~~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

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

Subtask #7
0 / 14.0

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