oj.uz

Submission #201683

# Submission time Handle Problem Language Result Execution time Memory
201683 2020-02-11T17:05:27 Z cheetose Walk (POI13_spa) C++11
100 / 100
 2777 ms 62324 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];
unordered_set<ll> S;
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 g(ll xx, ll yy)
{
	int T=1000000,cnt = 0;
	queue<ll> q;
	unordered_set<ll> chk;
	q.push(xx);
	chk.insert(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 (S.find(y) == S.end() && chk.find(y)==chk.end())
			{
				cnt++;
				q.push(y);
				chk.insert(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();
		S.insert(x);
	}
	puts(g(x, y) && g(y, x) ? "TAK" : "NIE");
}

Compilation message

spa.cpp: In function 'll r()':
spa.cpp:68: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:99: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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 7 ms 376 KB Output is correct
4 Correct 20 ms 1144 KB Output is correct
5 Correct 13 ms 1144 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 91 ms 9016 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 12344 KB Output is correct
2 Correct 230 ms 13884 KB Output is correct
3 Correct 2777 ms 61092 KB Output is correct
4 Correct 1567 ms 59884 KB Output is correct
5 Correct 1548 ms 59976 KB Output is correct
6 Correct 50 ms 4232 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 925 ms 56300 KB Output is correct
3 Correct 1843 ms 56232 KB Output is correct
4 Correct 1911 ms 56172 KB Output is correct
5 Correct 945 ms 55920 KB Output is correct
6 Correct 1874 ms 57068 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 504 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 1844 ms 56972 KB Output is correct
4 Correct 1904 ms 57144 KB Output is correct
5 Correct 985 ms 57192 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 6280 KB Output is correct
2 Correct 1238 ms 61948 KB Output is correct
3 Correct 2302 ms 62044 KB Output is correct
4 Correct 1988 ms 58748 KB Output is correct
5 Correct 27 ms 2088 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 4356 KB Output is correct
2 Correct 986 ms 57836 KB Output is correct
3 Correct 1927 ms 57980 KB Output is correct
4 Correct 2039 ms 59716 KB Output is correct
5 Correct 1053 ms 59632 KB Output is correct

Subtask #7
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 8536 KB Output is correct
2 Correct 1399 ms 62324 KB Output is correct
3 Correct 2499 ms 62244 KB Output is correct
4 Correct 2251 ms 60436 KB Output is correct
5 Correct 75 ms 6276 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 8376 KB Output is correct
2 Correct 45 ms 4052 KB Output is correct
3 Correct 2083 ms 58400 KB Output is correct
4 Correct 63 ms 6276 KB Output is correct
5 Correct 1148 ms 61576 KB Output is correct