oj.uz

Submission #147377

# Submission time Handle Problem Language Result Execution time Memory
147377 2019-08-29T11:58:05 Z Nucleist Vision Program (IOI19_vision) C++14
0 / 100
 6 ms 1276 KB 
#include <bits/stdc++.h> 
#include "vision.h"
using namespace std; 
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define pb push_back
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
void construct_network(int H,int W,int K)
{
  vector<int>zeros;
  add_not(0);
  for (int i = 0; i < H; ++i)
  {
  	for (int j = 0; j < W; ++j)
  	{
  		int cell = i*W+j;
  		zeros.pb(cell);
  	}
  }
  for (int i = 0; i < H; ++i)
  {
  	for (int j = 0; j < W; ++j)
  	{
  		for (int k = i+1; k < H; ++k)
  		{
  			for (int c = j+1; c < W; ++c)
  			{
  				vector<int>now;
  				int cell1 = i*W+j;
  				int cell2 = k*W+c;
  				now.pb(cell1);now.pb(cell2);
  				int kol = add_and(now);
  				if(kol==1)
  				{
  					if(abs(i-k)+abs(j-c)==K)
  						return;
  					else 
  					{
  						add_and(zeros);
  						return;
  					}
  					return;
  				}
  			}
  		}
  	}
  }
  return ;
}
//code the AC sol !
// BS/queue/map

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

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

Subtask #7
0 / 14.0

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

Subtask #8
0 / 19.0

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