oj.uz

Submission #560858

# Submission time Handle Problem Language Result Execution time Memory
560858 2022-05-12T03:56:43 Z Yazan_Alattar Dijamant (COI16_dijament) C++14
27 / 100
 168 ms 464 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 s[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){
        vector <int> tmp; bool ok = 1;
        cin >> s[i];

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

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

            if(mp[x] == 0 || mp[x] == node) ok = 0;
//            tmp.pb(mp[x]);
        }

//        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();

            if(mp[s[i]] == i) mp[s[i]] = 0;
        }
    }
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 464 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 408 KB Output is correct
4 Correct 1 ms 416 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 464 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 408 KB Output is correct
4 Correct 1 ms 416 KB Output is correct
5 Correct 1 ms 408 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 424 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 464 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 408 KB Output is correct
4 Correct 1 ms 416 KB Output is correct
5 Correct 1 ms 408 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 424 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Incorrect 1 ms 340 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

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