Submission #238212

#	Time	Username	Problem	Language	Result	Execution time	Memory
238212		Ruxandra985	Vision Program (IOI19_vision)	C++14	12 / 100	13 ms	1148 KiB

vision

#include <bits/stdc++.h>
#include <cassert>
#include <string>
#include "vision.h"

using namespace std;


/// ---------------------------------------------------------------------------------

int res[1000010];

int convert (int x , int y , int n , int m){

    return (x - 1) * m + y - 1;

}

int in_matrix (int i , int j , int n , int m){

    return (i > 0 && j > 0 && i <= n && j <= m);

}


void construct_network(int n, int m, int k) {

    int i , j , pi , pj , op;
    vector <int> v;
    op = 0;

    for (i = 1 ; i <= n ; i++){

        for (j = 1 ; j <= m ; j++){

            v.clear();

            for (pi = 0 ; pi <= k ; pi++){


                pj = k - pi;

                //if (in_matrix(i + pi , j + pj , n , m))
                  //  v.push_back(convert(i + pi , j + pj , n , m));

                //if (in_matrix(i + pi , j - pj , n , m))
                  //  v.push_back(convert(i + pi , j - pj , n , m));

                //if (in_matrix(i - pi , j + pj , n , m))
                  //  v.push_back(convert(i - pi , j + pj , n , m));

                if (in_matrix(i - pi , j - pj , n , m))
                    v.push_back(convert(i - pi , j - pj , n , m));



            }
            if (v.empty())
                continue;
            add_xor(v);
            op++;

            v.clear();
            v.push_back(n * m + (op - 1));
            v.push_back(convert(i , j , n , m));

            add_and(v);
            op++;
            /// res[ceva impar] e rezultatul unui and

        }

    }
    v.clear();
    for (i = 1 ; i < op ; i += 2){
        v.push_back(n * m + i);
    }

    add_or(v);


}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19