제출 #1237939

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1237939		Muhammad_Aneeq	Vision Program (IOI19_vision)	C++17	0 / 100	10 ms	1864 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
void construct_network(int n, int m, int k) 
{
		map<int,vector<int>>sl,sl1;
		map<int,int>ind,ind1;
		for (int i=0;i<n;i++)
		{
			for (int j=0;j<m;j++)
			{
				sl[i+j].push_back(i*m+j);
				sl1[i-j].push_back(i*m+j);
			}
		}
		set<int>s,s1;
		for (auto [i,j]:sl)
		{
			ind[i]=add_or(j);
			s.insert(i);
		}
		for (auto [i,j]:sl1)
		{
			s1.insert(i);
			ind1[i]=add_or(j);
		}
		vector<int>nx;
		for (auto i:s)
		{
			if (s.find(i+k)==s.end()) continue;
			vector<int>x;
			for (int j=i-k;j<=i+k;j++)
			{
				if (s1.find(j)!=s1.end())
					x.push_back(ind1[j]);
			}
			if (x.size()==0)
				continue;
			int g=add_or(x);
			nx.push_back(add_and({g,ind[i],ind[i+k]}));
		}
		for (auto i:s1)
		{
			if (s1.find(i+k)==s1.end()) continue;
			vector<int>x;
			for (int j=i-k;j<=i+k;j++)
			{
				if (s.find(j)!=s.end())
					x.push_back(ind[j]);
			}
			if (x.size()==0) continue;
			int g=add_or(x);
			nx.push_back(add_and({g,ind1[i],ind1[i+k]}));
		}
		add_or(nx);
		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