oj.uz

답안 #560835

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
560835 2022-05-12T03:43:56 Z Yazan_Alattar Dijamant (COI16_dijament) C++14
0 / 100
 240 ms 12552 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 1007;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-6;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;

map <string, int> mp;
string who[M];
vector <int> roots[M], v[M];
int n, dep[M][M], p[M][M], cmproot;

bool cmp(int a, int b){
    return dep[a][cmproot] > dep[b][cmproot];
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; ++i){
        string s; vector <int> tmp; bool ok = 1;
        cin >> s;

        if(mp[s]) ok = 0;
        else mp[s] = i;
        int node = mp[s];
        who[node] = s;

        while(1){
            cin >> s;
            if(s == ":") continue;
            if(s == ";") break;

            if(mp[s] == 0) ok = 0;
            tmp.pb(mp[s]);
        }

        if(tmp.empty()){
            roots[node].pb(node);
            dep[node][node] = 1;
        }

        for(auto j : tmp)
            for(auto k : roots[j])
                v[k].pb(j);

        for(int root = 1; root <= i; ++root) if(v[root].size()){
            cmproot = root;
            sort(all(v[root]), cmp);

            p[node][root] = v[root][0];
            dep[node][root] = dep[v[root][0]][root] + 1;
            roots[node].pb(root);

            int cur = node;
            for(auto j : v[root]){
                while(dep[j][root] < dep[cur][root]) cur = p[cur][root];

                if(dep[cur][root] == dep[j][root] && cur != j) ok = 0;
            }

            v[root].clear();
        }

        if(ok) cout << "ok\n";
        else{
            cout << "greska\n";

            for(int root = 1; root <= n; ++root){
                p[node][root] = 0;
                dep[node][root] = 0;
            }
            roots[node].clear();
            mp[who[node]] = 0;
            who[node] = "";
        }
    }
    return 0;
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 212 ms 11864 KB Output is correct
2 Correct 240 ms 12452 KB Output is correct
3 Correct 214 ms 12552 KB Output is correct
4 Correct 6 ms 4012 KB Output is correct
5 Correct 7 ms 6044 KB Output is correct
6 Correct 14 ms 8328 KB Output is correct
7 Correct 21 ms 8404 KB Output is correct
8 Correct 38 ms 8556 KB Output is correct
9 Correct 32 ms 8624 KB Output is correct
10 Incorrect 14 ms 8364 KB Output isn't correct
11 Halted 0 ms 0 KB -