oj.uz

Submission #622845

# Submission time Handle Problem Language Result Execution time Memory
622845 2022-08-04T16:32:35 Z Cyber_Wolf Zamjena (COCI18_zamjena) C++14
70 / 70
 167 ms 17700 KB 
//Problem Name: Zamjena 
//Problem Link: https://oj.uz/problem/view/COCI18_zamjena

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")

using namespace std;
using namespace __gnu_pbds;

#define lg long long
#define ordered_set	tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args);
#define endl \n
#define lbound(x, y) lower_bound(x.begin(), x.end(), y) 
#define ubound(x, y) upper_bound(x.begin(), x.end(), y) 
#define sortasc(v) sort(v.begin(), v.end())	
#define sortdesc(v) sort(v.rbegin(), v.rend())	
#define custom_array(a,l, r) int _##a[r-l+1]; int*a=_##a-l;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const lg MOD = 1e9+7, N = 2e5+5, M = 1e7+1, SZ = 1e3+1;
/*
bitset<N> primes;
lg pwrs[N], inv[N];

lg fast_power(lg n, lg k)
{
	if(!k)	return 1;
	if(k&1)	return (fast_power(n, k-1)*n)%MOD;
	lg x = fast_power(n, k/2)%MOD;
	return (x*x)%MOD;
}

void sieve()
{
	primes.set();
	primes[0] = primes[1] = 0;
	for(lg i = 2; i < N; i++)
	{
		if(!primes[i])	continue;
		for(lg j = i*i; j < N; j += i)
		{
			primes[j] = 0;
		}
	}
	return;
}

struct matrix
{
	vector<vector<lg>> con = vector<vector<lg>> (SZ, vector<lg> (SZ));
	matrix operator *(const matrix& a)
	{
		matrix product;
		for(int i = 0; i < (lg)con.size(); i++)
		{
			for(int j = 0; j < (lg)a.con[0].size(); j++)
			{
				for(int k = 0; k < (lg)a.con.size(); k++)
				{
					product.con[i][j] = (product.con[i][j]+(con[i][k]*a.con[k][j])%MOD)%MOD; 
				}
			}
		}
		return product;
	}
};

void preprocess(lg x)
{
	inv[2e5] = fast_power(x, MOD-2);
	for(int i = 2e5-1; i > 1; i--)
	{
		inv[i] = (inv[i+1]*i)%MOD;
	}
	pwrs[0] = 1;
	for(int i = 1; i <= 2e5; i++)
	{
		pwrs[i] = (pwrs[i]*i)%MOD;
	}
	return;
}

*/

map<string, lg> id1;
map<lg, string> id2;
lg id = 1;
vector<lg> adj[N];
lg vis[N];

lg check(lg x)
{
	string s = id2[x];
	return (s[0] >= '0' && s[0] <= '9');
}

lg dfs(lg src)
{
	vis[src] = true;
	lg ans = check(src);
	for(auto it : adj[src])
	{
		if(vis[it])	continue;
		ans += dfs(it);
	}
	return ans;
}

int main()
{
	fastio;
	lg n;
	cin >> n;
	vector<string> a(n), b(n);
	for(int i = 0; i < n; i++)	cin >> a[i];
	for(int i = 0; i < n; i++)	
	{
		cin >> b[i];
		if(!id1[a[i]])	id1[a[i]] = id++, id2[id-1] = a[i];
		if(!id1[b[i]])	id1[b[i]] = id++, id2[id-1] = b[i];
		adj[id1[a[i]]].push_back(id1[b[i]]);
		adj[id1[b[i]]].push_back(id1[a[i]]);
	}
	bool flag = true;
	for(auto it : id1)
	{
		if(vis[it.second])	continue;
		if(dfs(it.second) >= 2)	flag = false;
	}
	cout << (flag ? "DA\n" : "NE\n");

    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4988 KB Output is correct
3 Correct 5 ms 4948 KB Output is correct
4 Correct 3 ms 5028 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 5024 KB Output is correct
4 Correct 4 ms 5028 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5024 KB Output is correct
2 Correct 4 ms 5016 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 4 ms 5028 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 5 ms 4948 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5204 KB Output is correct
2 Correct 4 ms 5204 KB Output is correct
3 Correct 10 ms 5588 KB Output is correct
4 Correct 9 ms 5748 KB Output is correct
5 Correct 9 ms 5716 KB Output is correct
6 Correct 60 ms 5580 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 6972 KB Output is correct
2 Correct 40 ms 9292 KB Output is correct
3 Correct 70 ms 12076 KB Output is correct
4 Correct 118 ms 13476 KB Output is correct
5 Correct 167 ms 17700 KB Output is correct
6 Correct 96 ms 13592 KB Output is correct