oj.uz

Submission #429313

# Submission time Handle Problem Language Result Execution time Memory
429313 2021-06-15T20:30:31 Z Pbezz Vision Program (IOI19_vision) C++14
0 / 100
 10 ms 1100 KB 
#include "vision.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
typedef pair<ll,ll>pii;

const ll MAXN = 9500;
const ll INF = 1e9+7;

void construct_network(int H, int W, int K){
	vector<int>Ns;
	int d,a,i,j,f1,f2;

	int linha[H],coluna[W];

for(i=0;i<H;i++){
	vector<int>bruh;
	for(j=0;j<W;j++){
	bruh.pb(W*i+j);
	}
	linha[i] = add_or(bruh);
}

for(j=0;j<W;j++){
	vector<int>bruh;
	for(i=0;i<H;i++){
	bruh.pb(W*i+j);
	}
	coluna[j] = add_or(bruh);
}
//linha[0] e o index da memoria na qual esta o resultado
vector<int>bruh;
if(W>1){

	for(j=0;j<W-1;j++){
	Ns={coluna[j],coluna[j+1]};
	bruh.pb(add_and(Ns));
}

	d = add_or(bruh);//tem de haver algumas duas colunas

bruh.clear();
	for(i=0;i<H;i++){
	bruh.pb(linha[i]);
}

	a = add_xor(bruh);//#linhas com algo tem de ser impar
	Ns={d,a};
	f1=add_and(Ns);
}
if(H>1){
bruh.clear();
	for(i=0;i<H-1;i++){
	Ns={linha[i],linha[i+1]};
	bruh.pb(add_and(Ns));
}

	d = add_or(bruh);//tem de haver algumas duas linhas

bruh.clear();
	for(j=0;j<W;j++){
	bruh.pb(coluna[j]);
}

	a = add_xor(bruh);//#colunas com algo tem de ser impar
	Ns={d,a};
	f2=add_and(Ns);
}

	Ns={f1,f2};
	add_or(Ns);



}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:73:4: warning: 'f1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   73 |  Ns={f1,f2};
      |  ~~^~~~~~~~
vision.cpp:73:4: warning: 'f2' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB on inputs (0, 0), (0, 1), expected 0, but computed 1
3 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1100 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Incorrect 1 ms 204 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
6 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -