oj.uz

답안 #528383

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
528383 2022-02-20T08:30:02 Z Slavita Kutije (COCI21_kutije) C++14
35 / 70
 1000 ms 67052 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 = 1e5 + 228;
const int big = 1e9;
//ordered_set os; // os.order_of_key(4), (*os.find_by_order(5))
int n, m, q, ans;
bool mrk[N];
vector<int> g[N];
map<pi, bool> mem;

void dfs(int v, int st){
    if (mrk[v]) return;
    mrk[v] = 1;
    mem[{st, v}] = 1;
    for (int i = 0; i < si(g[v]); i++){
        int u = g[v][i];
        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++){
        for (int j = 1; j <= n; j++) mrk[j] = 0;
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 729 ms 59368 KB Output is correct
2 Correct 610 ms 51600 KB Output is correct
3 Correct 417 ms 34836 KB Output is correct
4 Correct 759 ms 67052 KB Output is correct
5 Correct 439 ms 31640 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2764 KB Output is correct
2 Correct 2 ms 2764 KB Output is correct
3 Correct 4 ms 3148 KB Output is correct
4 Correct 4 ms 3020 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 4 ms 3276 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2892 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2764 KB Output is correct
2 Correct 2 ms 2764 KB Output is correct
3 Correct 4 ms 3148 KB Output is correct
4 Correct 4 ms 3020 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 4 ms 3276 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2892 KB Output is correct
10 Correct 2 ms 2764 KB Output is correct
11 Correct 2 ms 2764 KB Output is correct
12 Correct 3 ms 2764 KB Output is correct
13 Correct 4 ms 3280 KB Output is correct
14 Correct 3 ms 2892 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2764 KB Output is correct
17 Correct 6 ms 3364 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 3 ms 2764 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 729 ms 59368 KB Output is correct
2 Correct 610 ms 51600 KB Output is correct
3 Correct 417 ms 34836 KB Output is correct
4 Correct 759 ms 67052 KB Output is correct
5 Correct 439 ms 31640 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 4 ms 3148 KB Output is correct
9 Correct 4 ms 3020 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2764 KB Output is correct
12 Correct 4 ms 3276 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2892 KB Output is correct
15 Correct 2 ms 2764 KB Output is correct
16 Correct 2 ms 2764 KB Output is correct
17 Correct 3 ms 2764 KB Output is correct
18 Correct 4 ms 3280 KB Output is correct
19 Correct 3 ms 2892 KB Output is correct
20 Correct 2 ms 2636 KB Output is correct
21 Correct 2 ms 2764 KB Output is correct
22 Correct 6 ms 3364 KB Output is correct
23 Correct 2 ms 2636 KB Output is correct
24 Correct 3 ms 2764 KB Output is correct
25 Correct 2 ms 2764 KB Output is correct
26 Correct 673 ms 39100 KB Output is correct
27 Correct 544 ms 36108 KB Output is correct
28 Execution timed out 1080 ms 59460 KB Time limit exceeded
29 Halted 0 ms 0 KB -