제출 #834466

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
834466		Marco_Escandon	Vision Program (IOI19_vision)	C++14	52 / 100	3 ms	468 KiB

vision

#include<bits/stdc++.h>
using namespace std;
#include "vision.h"
typedef int ll;
void construct_network(int H, int W, int K) {
    if(max(H,W)>30&&min(H,W)!=1)
    {
        vector<int> inst;
        for(int i=0; i<1; i++)
        {
            for(int j=0; j<1; j++)
            {
                vector<ll> query;
                for(int l=-K; l<=K; l++)
                {
                    if(i+l<H&& i+l>=0 && j+K-abs(l)<W)
                    {
                        query.push_back((i+l)*W+ j+K-abs(l));
                        //cout<<(i+l)*W+ j+K-abs(l)<<" ";
                    }
                }
                if(query.size()!=0)
                {
                    ll a= query[0];
                    if(query.size()!=1)
                        a=add_or(query);
                    inst.push_back(add_and({(i*W+j),a}));
                }
                //cout<<"\n";
            }
        }
        ll a=add_or(inst);
        return;
    }
    vector<int> inst;
	for(int i=0; i<H; i++)
	{
	    for(int j=0; j<W; j++)
        {
            vector<ll> query;
            for(int l=-K; l<=K; l++)
            {
                if(i+l<H&& i+l>=0 && j+K-abs(l)<W)
                {
                    query.push_back((i+l)*W+ j+K-abs(l));
                    //cout<<(i+l)*W+ j+K-abs(l)<<" ";
                }
            }
            if(query.size()!=0)
            {
                ll a= query[0];
                if(query.size()!=1)
                    a=add_or(query);
                inst.push_back(add_and({(i*W+j),a}));
            }
            //cout<<"\n";
        }
	}
	ll a=add_or(inst);
}

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

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:33:12: warning: unused variable 'a' [-Wunused-variable]
   33 |         ll a=add_or(inst);
      |            ^
vision.cpp:60:5: warning: unused variable 'a' [-Wunused-variable]
   60 |  ll a=add_or(inst);
      |     ^

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