Submission #1111049

#TimeUsernameProblemLanguageResultExecution timeMemory
1111049epicci23Sky Walking (IOI19_walk)C++17
Compilation error
0 ms0 KiB
#include "vision.h" #include "bits/stdc++.h" //#define int long long #define all(v) v.begin() , v.end() #define sz(a) (int)a.size() using namespace std; int N,M; inline int get_ind(int a,int b){ return a*M+b; } inline bool is_valid(int a,int b){ return a>=0 && a<N && b>=0 && b<M; } void construct_network(int n, int m, int k){ N=n,M=m; if(max(n,m)<=30){ vector<int> query; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ vector<int> sor; int a = i, b = j + k; for(int u=0;u<max(N,M);u++){ if(is_valid(a,b)) sor.push_back(get_ind(a,b)); a++,b--; } int res = add_or(sor); vector<int> xd; xd.push_back(get_ind(i,j)); xd.push_back(res); query.push_back(add_and(xd)); } } add_or(query); return; } if(min(n,m)!=1){ vector<int> query; int a = 0, b = k; for(int u=0;u<max(N,M);u++){ if(is_valid(a,b)){ vector<int> xd; xd.push_back(get_ind(0,0)); xd.push_back(get_ind(a,b)); query.push_back(add_and(xd)); } a++,b--; } add_or(query); return; } if(n==1){ vector<int> query; for(int i=0;i+k<m;i++){ vector<int> xd; xd.push_back(i); xd.push_back(i+k); query.push_back(add_and(xd)); } add_or(query); } else{ vector<int> query; for(int i=0;i+k<n;i++){ vector<int> xd; xd.push_back(i); xd.push_back(i+k); query.push_back(add_and(xd)); } add_or(query); } }

Compilation message (stderr)

walk.cpp:1:10: fatal error: vision.h: No such file or directory
    1 | #include "vision.h"
      |          ^~~~~~~~~~
compilation terminated.