제출 #296250

#제출 시각아이디문제언어결과실행 시간메모리
296250Leonardo16Vision Program (IOI19_vision)C++14
33 / 100
701 ms6644 KiB
/// Code by Leonardo16 /// “Your focus determines your reality.” – Qui-Gon Jinn #include<bits/stdc++.h> #include "vision.h" using namespace std; #pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //#pragma GCC option("arch=native","tune=native","no-zero-upper") //#pragma GCC target("avx2") //#define int long long #define ll long long #define sz size #define ull unsigned long long #define ld long double #define ii pair<int,int> #define fst first #define scd second #define vi vector<int> #define vii vector<ii> #define pb push_back #define pf push_front #define fl '\n' #define el endl #define all(x) x.begin() , x.end() #define rall(x) x.rbegin() , x.rend() /// Functions #define db(x) cerr << #x << ": " << (x) << '\n'; #define random() __builtin_ia32_rdtsc() #define lg2(x) 31-__builtin_clz(x) #define lg2ll(x) 63-__builtin_clzll(x) #define pi acos(-1) #define YN(x) cout<<((x)?("YES"):("NO"))<<fl; #define yn(x) cout<<((x)?("Yes"):("No"))<<fl; #define des(x,s1,s2,end1,end2) cout<<((x)?(s1):(s2))<<fl;if(x){end1;}else{end2;} #define precision(x) cout.setf(ios::fixed);cout.precision(x); /// Red-Black Tree Template //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //using namespace __gnu_pbds; //typedef tree < long long , null_type , less<long long> , rb_tree_tag , tree_order_statistics_node_update > ordered_set; //#define less_than(n) order_of_key(n) //#define en_pos(n) find_by_order(n) /// Prime numbers 173,179,311,331,737,1009,2011,2027,3079,4001,100003 ///===================================================================== // //void add_or(vi v){ // cout<< "OR : "; // for(int i=0;i<v.sz();i++){cout<<v[i]<<" ";}cout<<fl; //} // //void add_and(vi v){ // cout<< "AND : "; // for(int i=0;i<v.sz();i++){cout<<v[i]<<" ";}cout<<fl; //} // int dist(ii a,ii b){ return abs(a.fst-b.fst)+abs(a.scd-b.scd); } int real_dist(int n,int m,ii a,ii b){ if(a.fst>b.fst)swap(a,b); if(a.fst==b.fst){ return abs(a.scd-b.scd)+1; } int cnt=m*(b.fst-a.fst-1); cnt+=m-a.scd; cnt+=b.scd; return cnt; } vii v; int arr[202][202]; void count_dist(int n,int m,int k){ map<ii,int>mp; int wr=0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ arr[i][j]=wr++; } } for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ for(int h=i;h<n;h++){ for(int g=(h==i)?(j):(0);g<m;g++){ // cout<<i<<" "<<j<<" "<<h<<" "<<g<<fl; if( dist({i,j},{h,g})==k ){ mp[{arr[i][j],arr[h][g]}]++; } } } } } for(auto it:mp){ v.pb({it.fst.fst,it.fst.scd}); } } void construct_network( int n,int m,int k){ count_dist(n,m,k); int wr=n*m-1; for(auto it:v){ add_and({it.fst,it.scd}); wr++; } vi nv; for(int i=n*m;i<=wr;i++){ nv.pb(i); } if(nv.sz()==0){ for(int i=0;i<n*m;i++){ nv.pb(i); } add_and(nv); return; } add_or(nv); return; } // //int main(){ // construct_network(2,3,3); //}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...