oj.uz

답안 #147882

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
147882 2019-08-31T04:10:05 Z TOZ(#3661, cheetose) 체스판 네모네모로직 (FXCUP4_nonogram) C++17
100 / 100
 8 ms 640 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

#include "nonogram.h"
vector<Vi> SolveNonogram(int N,int M,vector<Vi> Rclue,vector<Vi> Cclue){
	vector<Vi> res(N,Vi(M));
	fup(i,0,N-1,1)fup(j,0,M-1,1)
	{
		if((i+j)&1)res[i][j]=-1;
		else res[i][j]=1;
	}
	fup(i,0,N-1,2)
	{
		if(Rclue[i].empty())
		{
			fup(j,0,M-1,1)res[i][j]=0;
			continue;
		}
		int ii=0;
		fup(j,0,M-1,1)
		{
			if(Rclue[i][ii]>0)
			{
				res[i][j]=1;
				Rclue[i][ii]--;
			}
			else
			{
				res[i][j]=0;
				ii++;
			}
		}
	}
	fup(j,0,M-1,2)
	{
		if(Cclue[j].empty())
		{
			fup(i,0,N-1,1)res[i][j]=0;
			continue;
		}
		int ii=0;
		fup(i,0,N-1,1)
		{
			if(Cclue[j][ii]>0)
			{
				res[i][j]=1;
				Cclue[j][ii]--;
			}
			else
			{
				res[i][j]=0;
				ii++;
			}
		}
	}
	return res;
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 476 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 6 ms 436 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct

Subtask #2
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 476 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 6 ms 436 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 8 ms 384 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 7 ms 592 KB Output is correct
11 Correct 7 ms 560 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 600 KB Output is correct
14 Correct 7 ms 640 KB Output is correct
15 Correct 6 ms 512 KB Output is correct