| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 671239 |
2022-12-12T13:39:53 Z |
4EVER |
Zamjena (COCI18_zamjena) |
C++11 |
|
59 ms |
6224 KB |
/******************************
* author : @hihihihi *
* date : 12 / 12 / 2022 *
******************************/
#include <bits/stdc++.h>
// #pragma GCC optimize("O2")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimize ("O3,unroll-loops,no-stack-protector")
// #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// template
#define PB push_back
#define ALL(i_) i_.begin(), i_.end()
#define LOG2(x_) (31 - __builtin_clz(x_))
#define getBit(x_, i_) ((x_ >> i_) & (ll) 1)
#define rd(l_, r_) (l_ + rng() % (r_ - l_ + 1))
#define FOR(i_, a_, b_) for(int i_ = (int) (a_); i_ <= (int) (b_); ++i_)
#define FORD(i_, a_, b_) for(int i_ = (int) (a_); i_ >= (int) (b_); --i_)
// debugger
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef DEBUG
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
typedef long long ll;
typedef long double ld;
template<class X, class Y> bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {
x = y;
return 1;
}
return 0;
}
template<class X, class Y> bool maximize(X &x, const Y &y) {
X eps = 1e-9;
if (x + eps < y) {
x = y;
return 1;
}
return 0;
}
template<class T> T Abs(const T &x) { return (x < 0 ? -x : x); }
template<class T> using heap_min = priority_queue<T, vector<T>, greater<T>>;
template<class T> using heap_max = priority_queue<T>;
const int mod = (int) 1e9 + 7;
template<class X, class Y> void Add(X &x, const Y &y){
x += y;
if(x >= mod) x -= mod;
if(x < 0) x += mod;
}
const int oo = (int) 1e9 + 99;
const array<int, 2> dxy8[] = { {-1, 0}, {1, 0}, {0, 1}, {0, -1}, {1, -1}, {1, 1}, {-1, 1}, {-1, -1} };
const array<int, 2> dxy4[] = { {-1, 0}, {1, 0}, {0, 1}, {0, -1} };
const int maxn = (int) 50011;
const int LOG = (int) LOG2(maxn) + 3;
void File(){
#define TASK ""
if(fopen(TASK".inp", "r")) {
freopen(TASK".inp", "r", stdin);
freopen(TASK".out", "w", stdout);
}
}
int n;
string a[maxn], b[maxn];
void ReadInput(){
cin >> n;
FOR(i, 1, n) cin >> a[i];
FOR(i, 1, n) cin >> b[i];
}
bool isNumber(string &s){
for(auto x : s) if(!(x >= '0' && x <= '9')) return 0;
return 1;
}
map<string, int> mp;
int root[2 * maxn];
int getRoot(int u){
return ((root[u] == u) ? u : (root[u] = getRoot(root[u])));
}
void Join(int u, int v){
u = getRoot(u);
v = getRoot(v);
if(u != v) root[v] = u;
}
int num[maxn];
void Solve(){
FOR(i, 1, 2 * n) root[i] = i;
int cnt = 0;
FOR(i, 1, n) {
if(mp.find(a[i]) == mp.end()) mp[a[i]] = ++cnt, num[cnt] = isNumber(a[i]);
}
FOR(i, 1, n){
if(isNumber(a[i]) && isNumber(b[i])){
if(a[i] != b[i]){
cout << "NE";
return;
}
}
else{
int v = (mp.find(b[i]) == mp.end()) ? -1 : mp[b[i]];
if(v == -1 || !num[getRoot(mp[b[i]])]){
if(v == -1) mp[b[i]] = ++cnt;
Join(mp[a[i]], mp[b[i]]);
if(isNumber(a[i]) || isNumber(b[i])) num[getRoot(mp[a[i]])] = 1;
}
else{
int u = getRoot(mp[a[i]]);
int v = getRoot(mp[b[i]]);
if(num[u] && num[v] && u != v){
cout << "NE";
return;
}
}
}
}
cout << "DA";
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
File();
ReadInput();
Solve();
cerr << "\nTime elapsed: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
return 0;
}
Compilation message
zamjena.cpp: In function 'void File()':
zamjena.cpp:93:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
93 | freopen(TASK".inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
zamjena.cpp:94:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
94 | freopen(TASK".out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
3412 KB |
Output is correct |
| 2 |
Correct |
2 ms |
3412 KB |
Output is correct |
| 3 |
Correct |
2 ms |
3412 KB |
Output is correct |
| 4 |
Correct |
2 ms |
3412 KB |
Output is correct |
| 5 |
Correct |
2 ms |
3412 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
3412 KB |
Output is correct |
| 2 |
Correct |
2 ms |
3412 KB |
Output is correct |
| 3 |
Correct |
2 ms |
3412 KB |
Output is correct |
| 4 |
Correct |
2 ms |
3412 KB |
Output is correct |
| 5 |
Correct |
2 ms |
3412 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
3412 KB |
Output is correct |
| 2 |
Correct |
2 ms |
3412 KB |
Output is correct |
| 3 |
Correct |
2 ms |
3412 KB |
Output is correct |
| 4 |
Correct |
2 ms |
3412 KB |
Output is correct |
| 5 |
Correct |
2 ms |
3412 KB |
Output is correct |
| 6 |
Incorrect |
2 ms |
3412 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
3412 KB |
Output is correct |
| 2 |
Correct |
3 ms |
3412 KB |
Output is correct |
| 3 |
Correct |
4 ms |
3632 KB |
Output is correct |
| 4 |
Correct |
6 ms |
3668 KB |
Output is correct |
| 5 |
Correct |
6 ms |
3668 KB |
Output is correct |
| 6 |
Correct |
5 ms |
3540 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
4012 KB |
Output is correct |
| 2 |
Correct |
27 ms |
4900 KB |
Output is correct |
| 3 |
Correct |
41 ms |
5816 KB |
Output is correct |
| 4 |
Incorrect |
59 ms |
6224 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
