oj.uz

답안 #855694

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
855694 2023-10-01T16:32:48 Z vjudge1 Zamjena (COCI18_zamjena) C++17
56 / 70
 1000 ms 7908 KB 
#pragma GCC optimize("unroll-loops", "O3")

//author: Ahmet Alp Orakci
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

bool check(string &a) {
    bool ans = true;
    for(char &ch : a)
        ans &= ('0' <= ch && ch <= '9');

    return ans;
}

#define ONLINE_JUDGE
void solve() {
    int n;
    cin >> n;

    vector <string> a(n +1), b(n +1);
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    for(int i = 1; i <= n; i++) 
        cin >> b[i];

    map <string, string> mp;

    vector <bool> vis[2];
    for(int i = 0; i < 2; i++)
        vis[i].resize(n +1);

    bool ans = true;
    for(int it = 1; it <= 100; it++) {
        for(int i = 1; i <= n; i++) {
            if(check(a[i]) && !vis[0][i]) {
                if(check(b[i])) {
                    if(a[i] != b[i]) {
                        return cout << "NE", void();
                    }
                } else {
                    if(mp.count(b[i])) {
                        if(mp[b[i]] != a[i]) {
                            return cout << "NE", void();
                        } 
                    } else {
                        mp[b[i]] = a[i];
                    }
                }
                vis[0][i] = vis[1][i] = true;
            } else if(check(b[i]) && !vis[1][i]) {
                swap(a[i], b[i]);
                if(check(b[i])) {
                    if(a[i] != b[i]) {
                        return cout << "NE", void();
                    }
                } else {
                    if(mp.count(b[i])) {
                        if(mp[b[i]] != a[i]) {
                            return cout << "NE", void();
                        } 
                    } else {
                        mp[b[i]] = a[i];
                    }
                }
                vis[0][i] = vis[1][i] = true;

                swap(a[i], b[i]);
            }
        }

        for(int i = 1; i <= n; i++) {
            if(mp.count(a[i])) {
                a[i] = mp[a[i]];
            }

            if(mp.count(b[i])) {
                b[i] = mp[b[i]];
            }
        }
    }

    cout << "DA";

    return;
}

signed main() {
    #ifndef ONLINE_JUDGE
        freopen(".in", "r", stdin);
        freopen(".out", "w", stdout);
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int t = 1; //cin >> t;
    for(int i = 1; i <= t; i++) {
        solve();
    }

    return 0;
}

Compilation message

zamjena.cpp: In function 'void solve()':
zamjena.cpp:33:10: warning: unused variable 'ans' [-Wunused-variable]
   33 |     bool ans = true;
      |          ^~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 348 KB Output is correct
2 Correct 10 ms 348 KB Output is correct
3 Correct 3 ms 600 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 35 ms 860 KB Output is correct
6 Correct 3 ms 604 KB Output is correct

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1112 KB Output is correct
2 Correct 310 ms 3020 KB Output is correct
3 Correct 24 ms 2396 KB Output is correct
4 Correct 31 ms 4620 KB Output is correct
5 Execution timed out 1050 ms 7908 KB Time limit exceeded
6 Halted 0 ms 0 KB -