제출 #1215857

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1215857		CELD_07	Vision Program (IOI19_vision)	C++20	0 / 100	1 ms	1476 KiB

vision

#include "vision.h"
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
typedef long long ll;
typedef long double ld;
#define endl "\n"
#define vll vector<ll>
#define sd second
#define ft first
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define pll pair<ll, ll>
#define mod 1000000007
#define _set tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update>
#define inf (ll)1e15
#define db(x) cout<<#x<<" : "<<x<<endl;
#define PRESICION(x) cout.setf(ios::fixed,ios::floatfield); cout.precision(x);
using namespace std;
using namespace __gnu_pbds;
ll dx[]={1, -1, 0, 0};
ll dy[]={0, 0, 1, -1};
inline ll sm(ll a, ll b){
return ((a%mod)+(b%mod))%mod;
}
inline ll ml(ll a, ll b){
return ((a%mod)*(b%mod))%mod;
}
inline ll rs(ll a, ll b){
return ((a%mod)-(b%mod)+mod)%mod;
}
ll bpow(ll a , ll b) {
if (b==0)return 1;
if (b%2!=0)return ((bpow(a, b-1)%mod)*(a%mod))%mod;
ll r=bpow (a ,b/ 2) ;
return ((r%mod)*(r%mod))%mod;
}
void construct_network(int H, int W, int K){
ll x, y, x1, y1;
vector<vector<ll>> ind(H, vector<ll>(W));
ll cnt=0;
for(int i=0; i<H; i++)for(int j=0; j<W; j++){ind[i][j]=cnt;cnt++;}
for(int i=0; i<H; i++){
for(int j=0; j<W; j++)
for(int i1=0; i1<H; i1++)
for(int j1=0; j1<W; j1++){
if(add_and({ind[i][j], ind[i1][j1]})==1){
x=i;
y=j;
if(abs(i-i1)+abs(j-j1)==K)return;
}
}
}
add_not({ind[x][y]});
}

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

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:48:11: warning: narrowing conversion of '(& ind.std::vector<std::vector<long long int> >::operator[](((std::vector<std::vector<long long int> >::size_type)i)))->std::vector<long long int>::operator[](((std::vector<long long int>::size_type)j))' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
   48 | if(add_and({ind[i][j], ind[i1][j1]})==1){
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
vision.cpp:48:11: warning: narrowing conversion of '(& ind.std::vector<std::vector<long long int> >::operator[](((std::vector<std::vector<long long int> >::size_type)i)))->std::vector<long long int>::operator[](((std::vector<long long int>::size_type)j))' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
vision.cpp:48:11: warning: narrowing conversion of '(& ind.std::vector<std::vector<long long int> >::operator[](((std::vector<std::vector<long long int> >::size_type)i1)))->std::vector<long long int>::operator[](((std::vector<long long int>::size_type)j1))' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
vision.cpp:48:11: warning: narrowing conversion of '(& ind.std::vector<std::vector<long long int> >::operator[](((std::vector<std::vector<long long int> >::size_type)i1)))->std::vector<long long int>::operator[](((std::vector<long long int>::size_type)j1))' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
vision.cpp:55:8: warning: narrowing conversion of '(& ind.std::vector<std::vector<long long int> >::operator[](((std::vector<std::vector<long long int> >::size_type)x)))->std::vector<long long int>::operator[](((std::vector<long long int>::size_type)y))' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
   55 | add_not({ind[x][y]});
      | ~~~~~~~^~~~~~~~~~~~~

• 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