제출 #584608

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
584608		Valters07	Vision Program (IOI19_vision)	C++14	0 / 100	7 ms	1492 KiB

vision

#include <bits/stdc++.h>
#include "vision.h"
#pragma GCC optimize("O2,unroll-loops")
#define fio ios_base::sync_with_stdio(0);cin.tie(0);
#define ll long long
#define en cin.close();return 0;
#define pb push_back
#define fi first//printf("%lli\n",cur);
#define se second//scanf("%lli",&n);
#define r0 return 0;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void construct_network(int h, int w, int k)
{
    vector<int> r[h], c[w];
    for(int i = 0;i<h;i++)
        for(int j = 0;j<w;j++)
            r[i].pb(i*w+j),
            c[j].pb(i*w+j);
    int p1 = -1, p2 = -1;
    vector<int> temp;
    for(int i = 0;i<h;i++)
        temp.pb(add_xor(r[i]));
    p1=add_or(temp);
    temp.clear();
    for(int i = 0;i<w;i++)
        temp.pb(add_xor(c[i]));
    p2=add_or(temp);
    temp.clear();
    int cond1=add_xor({p1,p2});
    return;
    for(int i = 1;i<h;i++)
    {
        vector<int> cur = r[i-1];
        cur.insert(cur.end(),r[i].begin(),r[i].end());
        temp.pb(add_or(cur));
    }
    for(int i = 1;i<w;i++)
    {
        vector<int> cur = c[i-1];
        cur.insert(cur.end(),c[i].begin(),c[i].end());
        temp.pb(add_or(cur));
    }
    int cond2 = add_xor(temp);
    add_and({cond1,cond2});
    return;
}

• 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