Submission #289444

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
289444	2020-09-02T16:31:52 Z	Dremix10	Vision Program (IOI19_vision)	C++17	12 / 100	14 ms	1656 KB

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 construct_network(int n, int m, int k) {
    N = n;
    M = m;
	int arr[n][m];
    int i,j,di;
    //int temp = add_not(0);
    vector<int> asks;
    for(i=0;i<n;i++)
    for(j=0;j<m;j++){
        vector<int> idx;
        idx.push_back(i*m+j);
        for(di=0;di<=k;di++){
            int dj = k - di;
            if(valid(i+di,j+dj))
                idx.push_back((i+di)*m+j+dj);
            //if(dj && valid(i+di,j-dj))
            //    idx.push_back((i+di)*m+j-dj);
        }
        p2(i,j)
        pv(idx)

        asks.push_back(add_xor(idx));
        asks.push_back(add_or(idx));

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

Compilation message

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

Subtask #1
0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	256 KB	Output is correct
2	Correct	256 KB	Output is correct
3	Correct	256 KB	Output is correct
4	Correct	256 KB	Output is correct
5	Incorrect	256 KB	on inputs (0, 1), (1, 0), expected 0, but computed 1
6	Halted	0 KB	-

Subtask #2
0 / 11.0

#	Verdict	Memory	Grader output
1	Correct	256 KB	Output is correct
2	Correct	256 KB	Output is correct
3	Correct	256 KB	Output is correct
4	Correct	256 KB	Output is correct
5	Incorrect	256 KB	on inputs (0, 1), (1, 0), expected 0, but computed 1
6	Halted	0 KB	-

Subtask #3
0 / 11.0

#	Verdict	Memory	Grader output
1	Correct	256 KB	Output is correct
2	Correct	256 KB	Output is correct
3	Correct	256 KB	Output is correct
4	Correct	256 KB	Output is correct
5	Incorrect	256 KB	on inputs (0, 1), (1, 0), expected 0, but computed 1
6	Halted	0 KB	-

Subtask #4
0 / 15.0

#	Verdict	Memory	Grader output
1	Correct	256 KB	Output is correct
2	Correct	256 KB	Output is correct
3	Correct	256 KB	Output is correct
4	Correct	256 KB	Output is correct
5	Incorrect	256 KB	on inputs (0, 1), (1, 0), expected 0, but computed 1
6	Halted	0 KB	-

Subtask #5
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	368 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	416 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	256 KB	Output is correct
22	Correct	0 ms	256 KB	Output is correct

Subtask #6
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	9 ms	1148 KB	Output is correct
4	Correct	14 ms	1656 KB	Output is correct
5	Correct	11 ms	1400 KB	Output is correct
6	Correct	8 ms	1148 KB	Output is correct
7	Correct	6 ms	1148 KB	Output is correct
8	Incorrect	3 ms	1148 KB	WA in grader: Too many instructions
9	Halted	0 ms	0 KB	-

Subtask #7
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	3 ms	1148 KB	WA in grader: Too many instructions
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 19.0

#	Verdict	Memory	Grader output
1	Correct	256 KB	Output is correct
2	Correct	256 KB	Output is correct
3	Correct	256 KB	Output is correct
4	Correct	256 KB	Output is correct
5	Incorrect	256 KB	on inputs (0, 1), (1, 0), expected 0, but computed 1
6	Halted	0 KB	-