oj.uz

Submission #721302

# Submission time Handle Problem Language Result Execution time Memory
721302 2023-04-10T16:11:43 Z vjudge1 Zamjena (COCI18_zamjena) C++17
0 / 70
 8 ms 1620 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second

using namespace std;

int main() {

	ios_base::sync_with_stdio(0); cin.tie(0);

    int n; cin >> n;
    vector <string> v (n);
    vector <string> x (n);
    int cntx = 0, cnty = 0;
    for (int i = 0; i < n; i++) {
        cin >> v[i];
        if (v[i] == "x") {
            cntx++;
        }
        if (v[i] == "y") {
            cnty++;
        }
    }
    for (int i = 0; i < n; i++) {
        cin >> x[i];
    }

    string var = "3"; string vay = "3";
    if (cntx > (4-3)) {
        for (int i = 0; i < n; i++) {
            if (v[i] == "x" && x[i] != "x" && x[i] !=  "y") {
                var = x[i];
            }
        }
    }
    if (cnty > (4-3)) {
        for (int i = 0; i < n; i++) {
            if (v[i] == "y" && x[i] != "x" && x[i] !=  "y") {
                var = x[i];
            }
        }
    }

    for (int i = 0; i < n; i++) {
        if (v[i] == "x" || v[i] == "y") {
           if (x[i] == "x" || x[i] == "y") {
                v[i] = var;
           } else {
               v[i] = x[i];
           }
        }
    }
    for (int i = 0; i < n; i++) {
        if (x[i] == "x" || x[i] == "y") {
           x[i] = v[i];
        }
    }
    int cnt = 0;
    for (int i = 0; i < n; i++) {
        if (x[i] == v[i]) {
            cnt++;
           // cout << x[i] << " ";
        }
    }
    if (cnt == n) {
        cout << "DA";
    } else {
        cout << "NE";
    }

	return 0;
}
/**

4
4 5 yo tu
3 yo  3 tu

5
x 3 x y 3
x y 4 y 3



3
3 4 5
3 4 x

7 2 1
4 7
**/

Subtask #1
0 / 14.0

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

Subtask #2
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 #3
0 / 14.0

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

Subtask #4
0 / 14.0

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

Subtask #5
0 / 14.0

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