oj.uz

답안 #201678

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201678 2020-02-11T17:01:15 Z cheetose Walk (POI13_spa) C++11
37 / 100
 5000 ms 129036 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 987654321
#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 int 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 };

char s[66];
const int m = 500000;
Vi in[m],chk[m];
int n, k;
ll r()
{
	scanf("%s", s);
	ll res = 0;
	fup(i, 0, k - 1, 1)res = res * 2 + s[i] - '0';
	return res;
}
bool f(Vi &v, ll x)
{
	for (ll y : v)if (y == x)return 1;
	return 0;
}
bool g(ll xx, ll yy)
{
	fup(i, 0, m - 1, 1)chk[i].clear();
	int T=n*k,cnt = 0;
	queue<ll> q;
	q.push(xx);
	chk[xx%m].pb(xx);
	while (!q.empty() && cnt<T)
	{
		ll x = q.front();
		q.pop();
		fup(i, 0, k - 1, 1)
		{
			ll y = x ^ (1LL << i);
			if (yy == y)return 1;
			if (!f(in[y%m],y) && !f(chk[y%m],y))
			{
				cnt++;
				q.push(y);
				chk[y%m].pb(y);
			}
		}
	}
	return cnt >= T;
}
int main() {
	scanf("%d%d", &k, &n);
	ll x = r(), y = r();
	fup(i, 0, n - 1, 1)
	{
		ll x = r();
		in[x%m].pb(x);
	}
	puts(g(x, y) && g(y, x) ? "TAK" : "NIE");
}

Compilation message

spa.cpp: In function 'll r()':
spa.cpp:69:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", s);
  ~~~~~^~~~~~~~~
spa.cpp: In function 'int main()':
spa.cpp:105:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &k, &n);
  ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 23928 KB Output is correct
2 Correct 20 ms 23928 KB Output is correct
3 Correct 22 ms 23928 KB Output is correct
4 Correct 31 ms 24312 KB Output is correct
5 Correct 23 ms 24312 KB Output is correct
6 Correct 21 ms 23800 KB Output is correct
7 Correct 21 ms 23800 KB Output is correct
8 Correct 21 ms 23800 KB Output is correct
9 Correct 22 ms 23800 KB Output is correct
10 Correct 19 ms 23800 KB Output is correct
11 Correct 109 ms 30072 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 145 ms 30844 KB Output is correct
2 Correct 198 ms 31428 KB Output is correct
3 Execution timed out 5076 ms 60376 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 25464 KB Output is correct
2 Correct 65 ms 27896 KB Output is correct
3 Correct 108 ms 30584 KB Output is correct
4 Correct 37 ms 25208 KB Output is correct
5 Correct 33 ms 25208 KB Output is correct
6 Correct 22 ms 23928 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 30840 KB Output is correct
2 Incorrect 49 ms 26128 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2441 ms 125272 KB Output is correct
2 Incorrect 2306 ms 120880 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3026 ms 129036 KB Output is correct
2 Incorrect 459 ms 50900 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 119 ms 29176 KB Output is correct
2 Correct 4936 ms 81104 KB Output is correct
3 Execution timed out 5079 ms 81064 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #8
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 119 ms 29048 KB Output is correct
2 Correct 61 ms 26080 KB Output is correct
3 Correct 2270 ms 56908 KB Output is correct
4 Correct 81 ms 27512 KB Output is correct
5 Correct 3552 ms 76532 KB Output is correct