| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 160500 |
2019-10-28T05:48:48 Z |
qkxwsm |
Zamjena (COCI18_zamjena) |
C++14 |
|
117 ms |
5596 KB |
/*
_____
.' '.
/ 0 0 \
| ^ |
| \ / |
\ '---' /
'._____.'
*/
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
struct custom_hash
{
template<class T>
unsigned long long operator()(T v) const
{
unsigned long long x = v;
x += FIXED_RANDOM; x += 11400714819323198485ull;
x = (x ^ (x >> 30)) * 13787848793156543929ull;
x = (x ^ (x >> 27)) * 10723151780598845931ull;
return x ^ (x >> 31);
}
};
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;
template<class T>
void readi(T &x)
{
x = 0;
bool negative = false;
char c = ' ';
while (c < '-')
{
c = getchar();
}
if (c == '-')
{
negative = true;
c = getchar();
}
while (c >= '0')
{
x = x * 10 + (c - '0');
c = getchar();
}
if (negative)
{
x = -x;
}
}
template<class T>
void printi(T output)
{
if (output == 0)
{
putchar('0');
return;
}
if (output < 0)
{
putchar('-');
output = -output;
}
int buf[20], n = 0;
while(output)
{
buf[n] = ((output % 10));
output /= 10;
n++;
}
for (n--; n >= 0; n--)
{
putchar(buf[n] + '0');
}
return;
}
template<class T>
void ckmin(T &a, T b)
{
a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
T nmod(T &x, U mod)
{
if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
return (b ? gcd(b, a % b) : a);
}
template<class T>
T randomize(T mod)
{
return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;
#define sz(x) ((int) (x.size()))
const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;
#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
namespace dsu
{
int dsu[MAXN], siz[MAXN];
void init_dsu(int n)
{
for (int i = 0; i < n; i++)
{
dsu[i] = i;
siz[i] = 1;
}
}
int find_parent(int u)
{
return (u == dsu[u] ? u : dsu[u] = find_parent(dsu[u]));
}
bool merge(int u, int v)
{
u = find_parent(u);
v = find_parent(v);
if (u == v) return false;
if (siz[u] > siz[v])
{
swap(u, v);
}
dsu[u] = v;
siz[v] += siz[u];
siz[u] = 0;
}
}
using namespace dsu;
int N, M;
map<string, int> vars;
pii A[MAXN], B[MAXN];
int val[MAXN];
int32_t main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
// cout << fixed << setprecision(10);
// cerr << fixed << setprecision(10);
// freopen ("file.in", "r", stdin);
// freopen ("file.out", "w", stdout);
cin >> N;
for (int i = 0; i < N; i++)
{
string t;
cin >> t;
if (isdigit(t[0]))
{
A[i] = MP(0, stoi(t));
}
else
{
if (vars.find(t) == vars.end())
{
vars[t] = M; M++;
}
A[i] = MP(1, vars[t]);
}
}
for (int i = 0; i < N; i++)
{
string t;
cin >> t;
if (isdigit(t[0]))
{
B[i] = MP(0, stoi(t));
}
else
{
if (vars.find(t) == vars.end())
{
vars[t] = M; M++;
}
B[i] = MP(1, vars[t]);
}
}
for (int i = 0; i < N; i++)
{
if (!A[i].fi && !B[i].fi)
{
if (A[i].se != B[i].se)
{
cout << "NE\n";
return 0;
}
}
}
init_dsu(M);
for (int i = 0; i < N; i++)
{
if ((B[i].fi) && (A[i].fi))
{
merge(B[i].se, A[i].se);
}
}
for (int i = 0; i < N; i++)
{
if (B[i].fi && !A[i].fi)
{
int u = find_parent(B[i].se);
if (val[u] != A[i].se && val[u] != 0)
{
cout << "NE\n";
return 0;
}
val[u] = A[i].se;
}
if (A[i].fi && !B[i].fi)
{
int u = find_parent(A[i].se);
if (val[u] != B[i].se && val[u] != 0)
{
cout << "NE\n";
return 0;
}
val[u] = B[i].se;
}
}
cout << "DA\n";
// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
return 0;
}
Compilation message
zamjena.cpp: In function 'bool dsu::merge(int, int)':
zamjena.cpp:179:2: warning: control reaches end of non-void function [-Wreturn-type]
}
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
504 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
504 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
504 KB |
Output is correct |
| 2 |
Correct |
3 ms |
376 KB |
Output is correct |
| 3 |
Correct |
6 ms |
632 KB |
Output is correct |
| 4 |
Correct |
7 ms |
760 KB |
Output is correct |
| 5 |
Correct |
6 ms |
632 KB |
Output is correct |
| 6 |
Correct |
6 ms |
632 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
16 ms |
1144 KB |
Output is correct |
| 2 |
Correct |
31 ms |
2040 KB |
Output is correct |
| 3 |
Correct |
60 ms |
3336 KB |
Output is correct |
| 4 |
Correct |
68 ms |
3576 KB |
Output is correct |
| 5 |
Correct |
117 ms |
5596 KB |
Output is correct |
| 6 |
Correct |
78 ms |
3448 KB |
Output is correct |
