oj.uz

답안 #627603

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
627603 2022-08-12T17:32:56 Z Farhan_HY Zamjena (COCI18_zamjena) C++14
56 / 70
 39 ms 65536 KB 
#include <bits/stdc++.h>
#define float double
#define pb push_back
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;
/// Benzema is the best player in the world
const int N = 1e6 + 6;
const int M = 1e3 + 3;
const int LOG = 31;
const int mod = 1e9 + 7;
const float pi = atan(1) * 4;
string a[N], b[N];
int n;
map<string, bool> vis;
map<string, set<string>> adj;
int x = -1;
bool dfs(string node)
{
    vis[node] = 1;
    bool ret = 1;
    if (node[0] >= '0' && node[0] <= '9')
    {
        int num = 0;
        for(auto i: node)
            num *= 10, num += i - '0';
        if (x == -1)
            x = num;
        ret &= num == x;
        if (ret == 0)
            return 0;
    }
    for(auto y: adj[node])
        if (!vis[y]) ret &= dfs(y);
    return ret;
}

main()
{
    IOS
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 1; i <= n; i++) cin >> b[i];
    for(int i = 1; i <= n; i++) adj[a[i]].insert(b[i]), adj[b[i]].insert(a[i]);
    bool ok = 1;
    for(int i = 1; i <= n; i++)
    {
        if (vis[a[i]]) continue;
        x = -1;
        ok &= dfs(a[i]);
    }
    for(int i = 1; i <= n; i++)
    {
        if (vis[b[i]]) continue;
        x = -1;
        ok &= dfs(b[i]);
    }
    if (ok) cout << "DA";
    else cout << "NE";
}
///use scanf

Compilation message

zamjena.cpp:41:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   41 | main()
      | ^~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 62884 KB Output is correct
2 Correct 32 ms 62868 KB Output is correct
3 Correct 34 ms 62920 KB Output is correct
4 Correct 31 ms 62924 KB Output is correct
5 Correct 35 ms 62912 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 62872 KB Output is correct
2 Correct 29 ms 62852 KB Output is correct
3 Correct 38 ms 62900 KB Output is correct
4 Correct 32 ms 62872 KB Output is correct
5 Correct 30 ms 62816 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 62924 KB Output is correct
2 Correct 32 ms 62836 KB Output is correct
3 Correct 36 ms 62832 KB Output is correct
4 Correct 30 ms 62916 KB Output is correct
5 Correct 30 ms 62868 KB Output is correct
6 Correct 30 ms 62804 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 63268 KB Output is correct
2 Correct 31 ms 63112 KB Output is correct
3 Correct 34 ms 63792 KB Output is correct
4 Correct 39 ms 63968 KB Output is correct
5 Correct 39 ms 63892 KB Output is correct
6 Correct 37 ms 63644 KB Output is correct

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 38 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -