oj.uz

Submission #82052

# Submission time Handle Problem Language Result Execution time Memory
82052 2018-10-28T20:04:11 Z josiftepe Zamjena (COCI18_zamjena) C++14
70 / 70
 329 ms 19920 KB 
#include <iostream>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <fstream>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll inf = (1LL << 60LL);
const int maxn = 50005;
int n;
string A[maxn], B[maxn];
map<string, string> mapa;
map<string, vector<string> > graph;
map<string, string> color;
bool number(string &s){
    if(s[0] >= '0' and s[0] <= '9') return true;
    return false;
}
map<string, bool> visited;
void bfs(string &s, string &color){
    queue<string> q;
    q.push(s);
    string node;
    while(!q.empty()){
        node = q.front();
        q.pop();
        if(mapa.find(node) != mapa.end()){
            if(mapa[node] != color){
                cout << "NE\n";
                exit(0);
            }
        }
        if(mapa.find(node) == mapa.end())
            mapa[node] = color;
        for(int i = 0; i < (int)graph[node].size(); i ++){
            string nxt = graph[node][i];
            if(!visited[nxt]){
                visited[nxt] = true;
                q.push(nxt);
                if(mapa.find(nxt) != mapa.end()){
                    if(mapa[nxt] != color){
                        cout << "NE\n";
                        exit(0);
                    }
                }
            }
        }
    }
}
int main(int argc, const char * argv[]) {
    ios_base::sync_with_stdio(false);
    cin >> n;
    for(int i = 0; i < n; ++i) {
        cin >> A[i];
    }
    for(int i = 0; i < n; ++i) {
        cin >> B[i];
    }
    for(int i = 0; i < n; i ++){
        if(number(A[i]) and number(B[i]) and A[i] != B[i]){
            return 0 * printf("NE\n");
        }
        if(!number(A[i]) and !number(B[i])){
            graph[A[i]].push_back(B[i]);
            graph[B[i]].push_back(A[i]);
        }
        else if(!number(A[i]) and number(B[i])){
            if(mapa.find(A[i]) != mapa.end() and mapa[A[i]] != B[i])return 0 * printf("NE\n");
            mapa[A[i]] = B[i];
            color[A[i]] = B[i];
        }
        else if(number(A[i]) and number(A[i])){
            if(mapa.find(B[i]) != mapa.end() and mapa[B[i]] != A[i])return 0 * printf("NE\n");
            color[B[i]] = A[i];
            mapa[B[i]] = A[i];
        }
    }
    for(map<string, string>::iterator it = color.begin(); it != color.end(); it ++){
        string tmp = it -> first;
        if(!visited[tmp]){
            bfs(tmp, it -> second);
        }
    }
    cout << "DA" << endl;
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3448 KB Output is correct
2 Correct 4 ms 3452 KB Output is correct
3 Correct 4 ms 3624 KB Output is correct
4 Correct 4 ms 3756 KB Output is correct
5 Correct 4 ms 3756 KB Output is correct

Subtask #2
14.0 / 14.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3756 KB Output is correct
2 Correct 4 ms 3756 KB Output is correct
3 Correct 4 ms 3756 KB Output is correct
4 Correct 4 ms 3756 KB Output is correct
5 Correct 4 ms 3756 KB Output is correct
6 Correct 4 ms 3756 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3948 KB Output is correct
2 Correct 7 ms 3948 KB Output is correct
3 Correct 11 ms 4456 KB Output is correct
4 Correct 8 ms 4456 KB Output is correct
5 Correct 16 ms 4604 KB Output is correct
6 Correct 9 ms 4604 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 5884 KB Output is correct
2 Correct 83 ms 9184 KB Output is correct
3 Correct 56 ms 9212 KB Output is correct
4 Correct 121 ms 11880 KB Output is correct
5 Correct 329 ms 19920 KB Output is correct
6 Correct 179 ms 19920 KB Output is correct