oj.uz

Submission #528431

# Submission time Handle Problem Language Result Execution time Memory
528431 2022-02-20T09:43:46 Z Slavita Kutije (COCI21_kutije) C++14
35 / 70
 1000 ms 49376 KB 
#include <bits/stdc++.h>
#pragma optimize("O3")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ve vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define si(v) (int)v.size()
#define en '\n'
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_muiltiset tree<int, null_type,less_equal<>, rb_tree_tag,tree_order_statistics_node_update>
//#define int long long
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;

const int N = 1e3 + 228;
const int big = 1e9;
//ordered_set os; // os.order_of_key(4), (*os.find_by_order(5))
int n, m, q, ans;
int mrk[N];
vector<int> g[N];
map<int, bool> mem[N];

void dfs(int v, int st){
    if (mrk[v] == st) {return;}
    if (mrk[v] > 0){
        mrk[v] = st;

        bool ok = 0;
        for (auto item : mem[v]) if (item.se == 1) {mem[st][item.fi] = 1; ok = 1;}
        if (ok) return;
    }
    mrk[v] = st;

    mem[st][v] = 1;
    for (auto u : g[v]){
        dfs(u, st);
    }
}

//#undef int
int main(){
    //#define int long long
    iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    cin >> n >> m >> q;
    for (int i = 1; i <= m; i++)
        for (int j = 1; j <= n; j++) {int x; cin >> x; g[j].pb(x);}

    for (int i = 1; i <= n; i++){
        dfs(i, i);
    }

    for (int i = 1; i <= q; i++){
        int x, y; cin >> x >> y;
        if (mem[x][y]) cout << "DA\n"; else cout << "NE\n";
    }
    return 0;
}
/*
*/

Compilation message

Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize("O3")
      |

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 500 ms 43836 KB Output is correct
2 Correct 419 ms 37924 KB Output is correct
3 Correct 341 ms 25124 KB Output is correct
4 Correct 567 ms 49376 KB Output is correct
5 Correct 342 ms 22888 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 12 ms 772 KB Output is correct
4 Correct 5 ms 760 KB Output is correct
5 Correct 2 ms 432 KB Output is correct
6 Correct 2 ms 412 KB Output is correct
7 Correct 23 ms 844 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 1 ms 396 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 12 ms 772 KB Output is correct
4 Correct 5 ms 760 KB Output is correct
5 Correct 2 ms 432 KB Output is correct
6 Correct 2 ms 412 KB Output is correct
7 Correct 23 ms 844 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 1 ms 396 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 13 ms 844 KB Output is correct
14 Correct 5 ms 588 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 18 ms 972 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 2 ms 460 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 500 ms 43836 KB Output is correct
2 Correct 419 ms 37924 KB Output is correct
3 Correct 341 ms 25124 KB Output is correct
4 Correct 567 ms 49376 KB Output is correct
5 Correct 342 ms 22888 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 12 ms 772 KB Output is correct
9 Correct 5 ms 760 KB Output is correct
10 Correct 2 ms 432 KB Output is correct
11 Correct 2 ms 412 KB Output is correct
12 Correct 23 ms 844 KB Output is correct
13 Correct 1 ms 444 KB Output is correct
14 Correct 2 ms 588 KB Output is correct
15 Correct 1 ms 396 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 13 ms 844 KB Output is correct
19 Correct 5 ms 588 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 18 ms 972 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 3 ms 588 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 812 ms 29720 KB Output is correct
27 Correct 469 ms 27076 KB Output is correct
28 Execution timed out 1006 ms 10760 KB Time limit exceeded
29 Halted 0 ms 0 KB -