oj.uz

Submission #259791

# Submission time Handle Problem Language Result Execution time Memory
259791 2020-08-08T14:44:25 Z itiam Zamjena (COCI18_zamjena) C++11
70 / 70
 351 ms 16248 KB 
#include <bits/stdc++.h>

using namespace std;
#define pb push_back

int n,cnt;
string a[50007],b[50007];
map< string, vector<string>> v;
map< string, int> bio;

void dfs(string x){
    if (bio[x]==1) return;
    bio[x]=1;
    if (isdigit(x[0])){ cnt++; }
    for (int i=0;i<v[x].size();i++){
        dfs(v[x][i]);
    }
}

void provjeri(string x){
    if (bio[x]==1)  return;
    cnt=0;
    dfs(x);
    if (cnt>1){
        cout << "NE";
        exit(0);
    }
}


int main(){
    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++){
        v[a[i]].pb(b[i]);
        v[b[i]].pb(a[i]);
    }
    for (int i=0;i<n;i++){
        provjeri(a[i]);
        provjeri(b[i]);
    }
    cout << "DA";
    return 0;
}

Compilation message

zamjena.cpp: In function 'void dfs(std::__cxx11::string)':
zamjena.cpp:15:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<v[x].size();i++){
                  ~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3712 KB Output is correct
2 Correct 4 ms 3584 KB Output is correct
3 Correct 8 ms 3968 KB Output is correct
4 Correct 10 ms 4096 KB Output is correct
5 Correct 15 ms 4224 KB Output is correct
6 Correct 14 ms 4096 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 5752 KB Output is correct
2 Correct 79 ms 7800 KB Output is correct
3 Correct 67 ms 9080 KB Output is correct
4 Correct 121 ms 11128 KB Output is correct
5 Correct 351 ms 16248 KB Output is correct
6 Correct 218 ms 12280 KB Output is correct