Submission #298005

#	Time	Username	Problem	Language	Result	Execution time	Memory
298005		infinite_iq	Vision Program (IOI19_vision)	C++14	33 / 100	177 ms	1556 KiB

vision

#include <bits/stdc++.h>
using namespace std ;
#define pb push_back 
#define ins insert 
typedef pair < int , int > pi ;
typedef vector < int > vi ;
#include "vision.h"

void construct_network(int H, int W, int K) {
        vi v ;
        set < pi > s ;
        for ( int i = 0 ; i < H ; i ++ ) {
                for ( int j = 0 ; j < W ; j ++ ) {
                        for ( int k = 0 ; k < H ; k ++ ) {
                                for ( int l = 0 ; l < W ; l ++ ) {
                                        if ( abs ( k - i ) + abs ( l - j ) == K ) {
                                                if ( s .find ( { i * W + j , k * W + l } ) == s .end () ) {
                                                        if ( s .find ( {  k * W + l , i * W + j } ) == s .end () ) {
                                                                v .pb ( add_and ( { i * W + j , k * W + l } ) ) ;
                                                                s .ins ( { i * W + j , k * W + l } ) ;
                                                        }
                                                }
                                        }
                                }
                        }
                }
        }
        add_or ( v ) ;
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 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