Submission #1232235

#TimeUsernameProblemLanguageResultExecution timeMemory
1232235ksu2009enVision Program (IOI19_vision)C++20
0 / 100
2 ms1476 KiB
#include <iostream> #include <vector> #include <string> #include <math.h> #include <cmath> #include <iomanip> #include <cstdio> #include <algorithm> #include <numeric> #include <map> #include <set> #include <queue> #include <stack> #include <deque> #include <bitset> #include <cstring> #include <unordered_map> #include "vision.h" using namespace std; typedef int ll; /* int add_and(std::vector<int> Ns); int add_or(std::vector<int> Ns); int add_xor(std::vector<int> Ns); int add_not(int N); */ vector<ll> vec(deque<ll> d){ vector<ll> v; for(auto i: d) v.push_back(i); return v; } void add_zero(ll n, ll m, deque<ll> &d, ll &cur){ vector<ll> all = {}; for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) all.push_back({i * m + j}); add_xor(all); d.push_front(cur++); } void add_one(ll n, ll m, deque<ll> &d, ll &cur){ vector<ll> all = {}; for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) all.push_back({i * m + j}); add_xor(all); cur++; add_not(cur - 1); d.push_front(cur++); } void construct_network(int n, int m, int k){ if(n == 1){ vector<ll> row, col; for(int i = n * m; i < n * m + n; i++) row.push_back(i); for(int i = n * m + n; i < n * m + n + m; i++) col.push_back(i); for(int i = 0; i < n; i++){ vector<ll> h; for(int j = 0; j < m; j++) h.push_back(i * m + j); add_or(h); } for(int j = 0; j < m; j++){ vector<ll> h; for(int i = 0; i < n; i++) h.push_back(i * m + j); add_or(h); } ll cur = n * m + n + m; deque<ll> len_row, len_col; add_one(n, m, len_row, cur); for(int i = 1; i <= m - 1; i++){ vector<ll> inds; for(int j = 0; j + i < m; j++){ add_and({col[j], col[j + i]}); inds.push_back(cur++); } add_or(inds); len_col.push_back(cur++); } if(!len_col.empty()){ add_or(vec(len_col)); cur++; add_not(cur - 1); len_col.push_front(cur++); } else{ add_one(n, m, len_col, cur); } deque<ll> f; for(int len = 0; len <= 0; len++){ if(len < len_row.size() && k - len < len_col.size()){ // cout << "? " << len_row[len] << << len_col[k - len] << endl; add_and({len_row[len], len_col[k - len]}); f.push_back(cur++); } } if(f.empty()){ add_zero(n, m, f, cur); } add_or(vec(f)); ll ans = cur; } else{ vector<ll> row, col; for(int i = n * m; i < n * m + n; i++) row.push_back(i); for(int i = n * m + n; i < n * m + n + m; i++) col.push_back(i); for(int i = 0; i < n; i++){ vector<ll> h; for(int j = 0; j < m; j++) h.push_back(i * m + j); add_or(h); } for(int j = 0; j < m; j++){ vector<ll> h; for(int i = 0; i < n; i++) h.push_back(i * m + j); add_or(h); } ll cur = n * m + n + m; deque<ll> len_row, len_col; for(int i = 1; i <= n - 1; i++){ vector<ll> inds; for(int j = 0; j + i < n; j++){ add_and({row[j], row[j + i]}); inds.push_back(cur++); } add_or(inds); len_row.push_back(cur++); } if(!len_row.empty()){ add_or(vec(len_row)); cur++; add_not(cur - 1); len_row.push_front(cur++); } else{ add_one(n, m, len_row, cur); } add_one(n, m, len_col, cur); deque<ll> f; for(int len = k; len <= k; len++){ if(len < len_row.size() && k - len < len_col.size()){ // cout << "? " << len_row[len] << << len_col[k - len] << endl; add_and({len_row[len], len_col[k - len]}); f.push_back(cur++); } } if(f.empty()){ add_zero(n, m, f, cur); } add_or(vec(f)); ll ans = cur; } } /* 1 2 2 0 0 0 1 */
#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...