oj.uz

Submission #1019471

# Submission time Handle Problem Language Result Execution time Memory
1019471 2024-07-10T22:45:34 Z stefanopulos Dijamant (COI16_dijament) C++17
100 / 100
 499 ms 9304 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;

#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
 
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 2005; 

int n;

vector<int> g[mxN];

bool P[mxN][mxN];

bool visited[mxN];
void dfs(int v, int r){
    visited[v] = 1; P[r][v] = 1;
    for(auto u : g[v]){
        if(!visited[u]){
            dfs(u, r);
        }
    }
}


int main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> n; 

    map<string,int> mp; vector<int> A;
    ff(i,1,n){
        
        string X; cin >> X;
        bool ok = (mp.count(X) == 0); 

        string s; cin >> s; vector<int> vec;
        while(1){
            cin >> s;
            if(s == ";")break;
            if(mp.count(s))vec.pb(mp[s]);
            else ok = 0;
        }

        if(ok == 0){
            cout << "greska" << '\n';
            continue;
        }

        for(auto c : vec)g[i].pb(c);
        ff(j,1,n)visited[j] = 0;
        dfs(i, i);

        for(auto a : A){
            if(!P[i][a])continue;

            for(auto b : A){
                if(!P[i][b] || P[a][b] || P[b][a])continue;

                ff(c,1,n){
                    if(P[a][c] && P[b][c]){
                        ok = 0;
                        break;
                    }
                }

                if(ok == 0)break;

            }
            if(ok == 0)break;

        }

        if(ok == 0){
            for(auto c : vec)g[i].pop_back();
            ff(j,1,n)P[i][j] = 0;
        }
        else mp[X] = i, A.pb(i);

        cout << (ok == 0 ? "greska" : "ok") << '\n';
    }

    return 0;
}
/*

13
1 : ;
2 : 1 ;
3 : 1 ;
4 : 2 ;
5 : 3 ;
6 : 4 5 ;
7 : 4 5 ;
8 : 4 5 ;
9 : 4 5 ;
10 : 2 3 ;
11 : 2 4 ;
12 : 4 3 :
13 : 2 1 :


// probati bojenje sahovski
*/

Compilation message

dijament.cpp: In function 'int main()':
dijament.cpp:106:22: warning: unused variable 'c' [-Wunused-variable]
  106 |             for(auto c : vec)g[i].pop_back();
      |                      ^

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 516 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 475 ms 8348 KB Output is correct
2 Correct 499 ms 9304 KB Output is correct
3 Correct 47 ms 4692 KB Output is correct
4 Correct 42 ms 1360 KB Output is correct
5 Correct 41 ms 1960 KB Output is correct
6 Correct 319 ms 2464 KB Output is correct
7 Correct 137 ms 2640 KB Output is correct
8 Correct 76 ms 2900 KB Output is correct
9 Correct 37 ms 2900 KB Output is correct
10 Correct 59 ms 2332 KB Output is correct
11 Correct 17 ms 2140 KB Output is correct
12 Correct 400 ms 8304 KB Output is correct