제출 #603083

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
603083		lcj	Vision Program (IOI19_vision)	C++17	0 / 100	9 ms	1108 KiB

vision

#include <bits/stdc++.h>
#include "vision.h"
#define loc(i, j) i*W+j
#define adv1(x) x.push_back(base + cnt);cnt++;

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

void construct_network(int H, int W, int K) {
	int cnt = 0;
	int base = H*W-1;
	vector<int> indires;
    vector<int> pos, neg;
    for (int i = -W+1; i < H; i++)
    {
        int cur = i;
        vector<int> locs;
        for (int j = 0; j < W; j++)
        {
            if (cur >= 0 && cur < H) {
                locs.push_back(loc(cur, j));
            }
            cur++;
        }
        add_or(locs);
        adv1(pos)
    }
    for (int i = 0; i < H+W-1; i++)
    {
        int cur = i;
        vector<int> locs;
        for (int j = 0; j < W; j++)
        {
            if (cur >= 0 && cur < H) {
                locs.push_back(loc(cur, j));
            }
            cur--;
        }
        add_or(locs);
        adv1(neg)
    }
    for (int i = 0; i < pos.size()-K; i++)
    {
        add_and({pos[i], pos[i+K]});
        adv1(indires)
    }
    for (int i = 0; i < neg.size()-K; i++)
    {
        add_and({neg[i], neg[i+K]});
        adv1(indires);
    }
    add_or(indires);
}

컴파일 시 표준 에러 (stderr) 메시지

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:45:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for (int i = 0; i < pos.size()-K; i++)
      |                     ~~^~~~~~~~~~~~~~
vision.cpp:50:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for (int i = 0; i < neg.size()-K; i++)
      |                     ~~^~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 15
• Subtask 5: 0 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19