Submission #289490

#	Time	Username	Problem	Language	Result	Execution time	Memory
289490		Dremix10	Vision Program (IOI19_vision)	C++17	8 / 100	1 ms	384 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#define F first
#define S second
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#ifdef dremix
    #define p(x) cerr<<#x<<" = "<<x<<endl;
    #define p2(x,y) cerr<<#x<<" , "<<#y<<" = "<<x<<" , "<<y<<endl;
    #define pp(x) cerr<<#x<<" = ("<<x.F<<" , "<<x.S<<")"<<endl;
    #define pv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u<<", ";cerr<<"}"<<endl;
    #define ppv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u.F<<"-"<<u.S<<", ";cerr<<"}"<<endl;
#else
    #define p(x)
    #define p2(x,y)
    #define pp(x)
    #define pv(x)
    #define ppv(x)
#endif
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int maxp = 22;
const ld EPS = 1e-18;
const ll INF = 1e18;
const int MOD = 1e9+7;

int N,M;

bool valid(int i, int j){
    return (i>=0 && i<N && j>=0 && j<M);
}

void solve_sub6(int n, int m, int k){
    vector<int> asks;
    map<pi,bool> v;

    int i = 0,j = 0;
    int di;
        vector<int> idx;
        int curr = i*m+j;
        //idx.push_back(curr);
        for(di=-k;di<=k;di++){
            int dj = k - abs(di);
            if(valid(i+di,j+dj)){
                int nxt = (i+di)*m+j+dj;
                if(!v[{min(nxt,curr),max(nxt,curr)}]){
                    idx.push_back(nxt);
                    v[{min(nxt,curr),max(nxt,curr)}]=true;
                }
            }
            //if(dj && valid(i+di,j-dj))
            //    idx.push_back((i+di)*m+j-dj);
        }
        p2(i,j)
        pv(idx)
        if(!idx.empty()){
            asks.push_back(add_xor(idx));
            asks.push_back(add_xor({curr}));
        }

    pv(asks)
    vector<int> fin;
    for(i=0;i<asks.size();i+=2)
        fin.push_back(add_and({asks[i],asks[i+1]}));
    pv(fin)
    int temp = add_or(fin);
    return;

}

void construct_network(int n, int m, int k) {
    N = n;
    M = m;
	solve_sub6(n,m,k);
	return;
	//int arr[n][m];
    int i,j,di;
    //int temp = add_not(0);
    vector<int> asks;
    map<pi,bool> v;
    for(i=0;i<n;i++)
    for(j=0;j<m;j++){
        vector<int> idx;
        int curr = i*m+j;
        //idx.push_back(curr);
        for(di=-k;di<=k;di++){
            int dj = k - abs(di);
            if(valid(i+di,j+dj)){
                int nxt = (i+di)*m+j+dj;
                if(!v[{min(nxt,curr),max(nxt,curr)}]){
                    idx.push_back(nxt);
                    v[{min(nxt,curr),max(nxt,curr)}]=true;
                }
            }
            //if(dj && valid(i+di,j-dj))
            //    idx.push_back((i+di)*m+j-dj);
        }
        p2(i,j)
        pv(idx)
        if(!idx.empty()){
            asks.push_back(add_xor(idx));
            asks.push_back(add_xor({curr}));
        }
    }
    pv(asks)
    vector<int> fin;
    for(i=0;i<asks.size();i+=2)
        fin.push_back(add_and({asks[i],asks[i+1]}));
    pv(fin)
    int temp = add_or(fin);
    return;
}

/// g++ grader.cpp vision.cpp -Ddremix

Compilation message (stderr)

vision.cpp: In function 'void solve_sub6(int, int, int)':
vision.cpp:68:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |     for(i=0;i<asks.size();i+=2)
      |             ~^~~~~~~~~~~~
vision.cpp:71:9: warning: unused variable 'temp' [-Wunused-variable]
   71 |     int temp = add_or(fin);
      |         ^~~~
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:112:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |     for(i=0;i<asks.size();i+=2)
      |             ~^~~~~~~~~~~~
vision.cpp:115:9: warning: unused variable 'temp' [-Wunused-variable]
  115 |     int temp = add_or(fin);
      |         ^~~~

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