oj.uz

답안 #166189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
166189 2019-12-01T06:11:55 Z keta_tsimakuridze Vision Program (IOI19_vision) C++14
0 / 100
 4 ms 888 KB 
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
int ans(int H, int W, int K)
{
vector<int>V;
	vector<int> Dr[405],Dl[405],cur,p,b,x;
	int diag[405],dia[450],k;
	for(int i=0;i<W;i++)
	for(int j=0;j<H;j++)
	{
		Dr[i-j+H-1].push_back(i*W+j);	
		Dl[i+j].push_back(i*W+j);
	}
	for(int i=W+H-1;i>=0;i--)
	{
		cur.clear();
		cur.push_back(add_or(Dr[i]));
		 p.clear();
		 p.push_back(diag[i+1]);
		diag[i]=add_and({add_or(cur),add_or(p)});
	
		if(i+K<=W+H-1)
		{
		p.clear();
		p.push_back(diag[i+K]);
		p.push_back(add_or(cur));
		b.push_back(add_and(p));
		}
		if(i+K<=W+H-2)
		{
		 p.clear();
		 p.push_back(diag[i+K+1]);
		 p.push_back(add_and(cur));
		b.push_back((add_and(p)));
	}
		V.push_back(add_xor(b));
		
		
	}
	for(int i=0;i<=W+H-1;i++)
	{
		cur.clear();
		cur.push_back(add_or(Dl[i]));
		 p.clear();
		 p.push_back(dia[i+1]);
		dia[i]=add_and({add_or(cur),add_or(p)});
	
		if(i-K>=0){
			 p.clear();
		 p.push_back(dia[i-K]);
			b.push_back(add_and({diag[i-K],add_or(cur)}));
			
			
		}
		if(i-K>=1){
		 p.clear();
		 p.push_back(diag[i-K-1]);
		 p.push_back(add_and(cur));
		b.push_back(add_and(p));
	}
	V.push_back(add_xor(b));	
	}
	return add_or(V);
}
void construct_network(int H, int W, int K){
	ans(H,W,K);
}

Compilation message

vision.cpp: In function 'int ans(int, int, int)':
vision.cpp:8:25: warning: unused variable 'k' [-Wunused-variable]
  int diag[405],dia[450],k;
                         ^

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 504 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 888 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -