oj.uz

Submission #721423

# Submission time Handle Problem Language Result Execution time Memory
721423 2023-04-10T21:19:01 Z vjudge1 Zamjena (COCI18_zamjena) C++17
56 / 70
 409 ms 7328 KB 
#include <bits/stdc++.h>
#define sts stable_sort
#define B begin()
#define rB rbegin()
#define E end()
#define rE rend()
#define F first
#define S second
#define pb push_back
#define ppb pop_back()
#define pf push_front
#define ppf pop_front()
#define eb emplace_back
#define ll long long
#define ui unsigned int
#define ull unsigned long long

using namespace std;

const int MAXN = 1e6 + 4;
const int MOD = 1e9 + 7;
map<string, int> m;

int to_int(string s){
    int n = 0;

    for(int i = 0; i < s.size(); i++){
        n *= 10;
        n += s[i] - '0';
    }

    return n;
}

bool comp(string s){
    if(s[0] == 'a' || s[0] == 'b' || s[0] == 'c' || s[0] == 'd' || s[0] == 'e' || s[0] == 'f' || s[0] == 'g' || s[0] == 'h' || s[0] == 'i' || s[0] == 'j' || s[0] == 'k' || s[0] == 'l' || s[0] == 'm' || s[0] == 'n' || s[0] == 'o' || s[0] == 'p' || s[0] == 'q' || s[0] == 'r' || s[0] == 's' || s[0] == 't' || s[0] == 'u' || s[0] == 'v' || s[0] == 'w' || s[0] == 'x' || s[0] == 'y' || s[0] == 'z'){
        return 1;
    }else{
        return 0;
    }
}

bool f(vector<pair<string, string> > &v, int &n){
    for(int i = 0; i < n; i++){
            if(comp(v[i].S) && comp(v[i].F)){
                if(m[v[i].F] == -1 && m[v[i].S] != -1){
                    m[v[i].F] = m[v[i].S];
                }else if(m[v[i].S] == -1 && m[v[i].F] != -1){
                    m[v[i].S] = m[v[i].F];
                }else if(m[v[i].S] != m[v[i].F]){
                    return 0;
                }
            }else if(!comp(v[i].S)){
                if(m[v[i].F] != -1 && m[v[i].F] != to_int(v[i].S)){
                    return 0;
                }
                m[v[i].F] = to_int(v[i].S);
            }else if(!comp(v[i].F)){
                if(m[v[i].S] != -1 && m[v[i].S] != to_int(v[i].F)){
                    return 0;
                }
                m[v[i].S] = to_int(v[i].F);
            }else if(v[i].S != v[i].F){
                return 0;
            }
    }
    return 1;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    int n; cin >> n;

    vector<pair<string, string> > v(n);

    for(int i = 0; i < n; i++){
        cin >> v[i].F; m[v[i].F] = -1;
    }
    for(int i = 0; i < n; i++){
        cin >> v[i].S; m[v[i].S] = -1;
    }
    f(v, n);
    f(v, n);
    f(v, n);
    f(v, n);
    f(v, n);
    bool a = f(v, n);

    if(a){
        cout << "DA\n";
    }else{
        cout << "NE\n";
    }

    return 0;
}

Compilation message

zamjena.cpp: In function 'int to_int(std::string)':
zamjena.cpp:27:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i = 0; i < s.size(); i++){
      |                    ~~^~~~~~~~~~

Subtask #1
0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 432 KB Output is correct
2 Correct 4 ms 420 KB Output is correct
3 Correct 7 ms 596 KB Output is correct
4 Correct 6 ms 724 KB Output is correct
5 Correct 13 ms 716 KB Output is correct
6 Correct 10 ms 596 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1364 KB Output is correct
2 Correct 98 ms 2772 KB Output is correct
3 Correct 136 ms 4292 KB Output is correct
4 Correct 82 ms 5204 KB Output is correct
5 Correct 409 ms 7328 KB Output is correct
6 Correct 306 ms 5428 KB Output is correct