Submission #823767

#	Time	Username	Problem	Language	Result	Execution time	Memory
823767		ZHIRDILBILDIZ	Vision Program (IOI19_vision)	C++14	0 / 100	3 ms	976 KiB

vision

#include<bits/stdc++.h>
#include "vision.h"
#define fi first
#define se second
#define ll long long
using namespace std ;
const int N = 200, M = 200 ;
//int add_not(int n)
//{
//}
//int add_and(vector<int> v)
//{
//}
//int add_or(vector<int> v)
//{
//}
//int add_xor(vector<int> v)
//{
//}
void construct_network(int n, int m, int k)
{
    for(int x1 = 0 ; x1 < n ; x1++)
        for(int y1 = 0 ; y1 < m ; y1++)
            for(int x2 = x1 ; x2 < n ; x2++)
                for(int y2 = y1 ; y2 < m ; y2++)
                {
                    if(abs(x1 - x2) + abs(y2 - y1) == 0)
                        continue ;
                    vector<int> v ;
                    v.push_back(x1 * m + y1) ;
                    v.push_back(x2 * m + y2) ;
                    if(add_and(v) == 1 && add_xor(v) == 0)
                    {
                        if(abs(x1 - x2) + abs(y2 - y1) == k)
                            add_and(v) ;
                        else
                            add_xor(v) ;
                        return ;
                    }
                }
}
//signed main()
//{
//    int n, m, k ;
//    cin >> n >> m >> k ;
//    for(int i = 0 ; i < n ; i++)
//        for(int j = 0 ; j < n ; j++)
//            cin >> a[i][j] ;
//    construct_network(n, m, k) ;
//    return 0 ;
//}

• 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