oj.uz

Submission #798309

# Submission time Handle Problem Language Result Execution time Memory
798309 2023-07-30T15:10:02 Z AndiR Zamjena (COCI18_zamjena) C++14
14 / 70
 5 ms 4564 KB 
#include <iostream>
#include <unordered_map>
#include <vector>

using namespace std;
const int Nmax=50000;

int n, ind, sol[Nmax*2];
string v[Nmax];
unordered_map <long long, int> m;
vector <int> ad[Nmax*2];
bool ok=1;

void dfs (int nod, int val){
    if (sol[nod]==0){
        sol[nod]=val;
        for (int i=0; i<ad[nod].size(); i++)
            dfs(ad[nod][i], val);
    }
    else if (sol[nod]!=val){
        ok=0; cout<<nod<<' '<<val<<' ';
    }
}
void eq (string &s, int val){
    long long h=0;
    for (int i=0; i<s.size(); i++)
        h=h*26+s[i]-'a';
    if (m.count(h)==0)
        m[h]=ind++;
    dfs(m[h], val+1);
}
void check (string &s1, string &s2){
    long long h1=0, h2=0;
    for (int i=0; i<s1.size(); i++)
        h1=h1*26+s1[i]-'a';
    for (int i=0; i<s2.size(); i++)
        h2=h2*26+s2[i]-'a';
    if (m.count(h1)==0)
        m[h1]=ind++;
    if (m.count(h2)==0)
        m[h2]=ind++;
    if (sol[m[h1]]!=0 && sol[m[h2]]!=0 && sol[m[h1]]!=sol[m[h2]])
        ok=0;
    else if (sol[m[h1]]==0 && sol[m[h2]]!=0)
        dfs(m[h1], sol[m[h2]]);
    else if (sol[m[h2]]==0 && sol[m[h1]]!=0)
        dfs(m[h2], sol[m[h1]]);
    ad[m[h1]].push_back(m[h2]);
    ad[m[h2]].push_back(m[h1]);
}
int main()
{
    cin>>n;
    for (int i=0; i<n; i++)
        cin>>v[i];
    string s;
    for (int i=0; i<n && ok; i++){
        cin>>s;
        int v1=-1, v2=-1;
        if (v[i][0]<='9'){
            v1=0;
            for (int j=0; j<v[i].size(); j++)
                v1=v1*10+v[i][j]-'0';
        }
        if (s[0]<='9'){
            v2=0;
            for (int j=0; j<s.size(); j++)
                v2=v2*10+s[j]-'0';
        }
        if (v1!=-1 && v2!=-1 && v1!=v2)
            ok=0;
        else if (v1!=v2){
            if (v1==-1)
                eq(v[i], v2);
            else eq(s, v1);
        }
        else if (v1==-1)
            check(v[i], s);
    }
    if (ok)
        cout<<"DA";
    else cout<<"NE";
    return 0;
}

Compilation message

zamjena.cpp: In function 'void dfs(int, int)':
zamjena.cpp:17:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |         for (int i=0; i<ad[nod].size(); i++)
      |                       ~^~~~~~~~~~~~~~~
zamjena.cpp: In function 'void eq(std::string&, int)':
zamjena.cpp:26:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for (int i=0; i<s.size(); i++)
      |                   ~^~~~~~~~~
zamjena.cpp: In function 'void check(std::string&, std::string&)':
zamjena.cpp:34:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for (int i=0; i<s1.size(); i++)
      |                   ~^~~~~~~~~~
zamjena.cpp:36:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for (int i=0; i<s2.size(); i++)
      |                   ~^~~~~~~~~~
zamjena.cpp: In function 'int main()':
zamjena.cpp:62:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             for (int j=0; j<v[i].size(); j++)
      |                           ~^~~~~~~~~~~~
zamjena.cpp:67:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |             for (int j=0; j<s.size(); j++)
      |                           ~^~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4180 KB Output is correct
2 Incorrect 3 ms 4180 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Incorrect 3 ms 4180 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4180 KB Output is correct
2 Incorrect 2 ms 4180 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4488 KB Output is correct
2 Incorrect 5 ms 4564 KB Output isn't correct
3 Halted 0 ms 0 KB -