oj.uz

답안 #851821

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
851821 2023-09-20T16:29:36 Z vjudge1 Kutije (COCI21_kutije) C++17
35 / 70
 1000 ms 2900 KB 
#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
    #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#endif
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define lim 1000000
#define till 1000001
// # of primes till 1e6 = 7e4
using namespace std;
using pii = array<int,2>;
const int mod=1000000007ll;

bool v[1000][1000];
bool vis[1000];
int n,m,q;

void dfs(int i){
    bool might=0;
    for(int j=0;j<n;j++){
        if(v[i][j]&&!vis[j]){
            vis[j]=1;
            for(int k=0;k<n;k++){
                if(v[j][k]&&!v[i][k]){
                    v[i][k]=1;
                    might=1;
                }
            }
        }
    }
    if(might)dfs(i);
}

void solve(){
    cin>>n>>m>>q;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            v[i][j]=0;
        }
    }
    for(int i=0;i<m;i++){
        for(int j=0;j<n;j++){
            int tem;
            cin>>tem;
            tem--;
            v[tem][j]=1;
        }
    }
    for(int i=0;i<n;i++){
        memset(vis,0,n);
        dfs(i);
    }
    for(int i=0;i<n;i++){
        v[i][i]=1;
    }
    while(q--){
        int x,y;
        cin>>x>>y;
        x--,y--;
        if(v[x][y]==1){
            cout<<"DA\n";
        }else{
            cout<<"NE\n";
        }
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
#ifdef Local  
    freopen("in","r",stdin);
    freopen("out","w",stdout);
#endif
    int t=1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 542 ms 2700 KB Output is correct
2 Correct 436 ms 2656 KB Output is correct
3 Correct 198 ms 2332 KB Output is correct
4 Correct 567 ms 2692 KB Output is correct
5 Correct 64 ms 2900 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 560 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 560 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 542 ms 2700 KB Output is correct
2 Correct 436 ms 2656 KB Output is correct
3 Correct 198 ms 2332 KB Output is correct
4 Correct 567 ms 2692 KB Output is correct
5 Correct 64 ms 2900 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 1 ms 560 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 170 ms 2900 KB Output is correct
27 Correct 114 ms 2712 KB Output is correct
28 Execution timed out 1032 ms 1112 KB Time limit exceeded
29 Halted 0 ms 0 KB -