oj.uz

답안 #862639

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862639 2023-10-18T17:18:17 Z Ahmed_Solyman Kutije (COCI21_kutije) C++14
15 / 70
 1000 ms 208400 KB 
/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>
 
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
    return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
bool vis[1001];
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    #ifndef ONLINE_JUDGE
    //freopen("input.in", "r", stdin);
    //freopen("output.out", "w", stdout);
    #endif
    fast
    int n,m,q;cin>>n>>m>>q;
    vector<int>adj[n+5];
    for(int i=0;i<m;i++){
    	for(int j=1;j<=n;j++){
    		int x;cin>>x;
    		adj[j].push_back(x);
    	}
    }
    vector<vector<bool>>can(n+5,vector<bool>(n+5));
    for(int i=1;i<=n;i++){
    	queue<int>q;
    	q.push(i);
    	fil(vis,0);
    	while(q.size()){
    		int x=q.front();
    		q.pop();
    		vis[x]=1;
    		can[i][x]=1;
    		for(auto ch:adj[x]){
    			if(!vis[ch]){
    				q.push(ch);
    			}
    		}
    	}
    }
    while(q--){
    	int x,y;cin>>x>>y;
    	cout<<(can[x][y]?"DA":"NE")<<endl;
    }
    return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 2140 KB Output is correct
2 Correct 74 ms 1944 KB Output is correct
3 Correct 60 ms 1876 KB Output is correct
4 Correct 80 ms 2044 KB Output is correct
5 Correct 74 ms 2140 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 76 ms 348 KB Output is correct
4 Correct 38 ms 540 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 8 ms 348 KB Output is correct
7 Correct 43 ms 540 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Execution timed out 1100 ms 208400 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 76 ms 348 KB Output is correct
4 Correct 38 ms 540 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 8 ms 348 KB Output is correct
7 Correct 43 ms 540 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Execution timed out 1100 ms 208400 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 2140 KB Output is correct
2 Correct 74 ms 1944 KB Output is correct
3 Correct 60 ms 1876 KB Output is correct
4 Correct 80 ms 2044 KB Output is correct
5 Correct 74 ms 2140 KB Output is correct
6 Correct 15 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 76 ms 348 KB Output is correct
9 Correct 38 ms 540 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 8 ms 348 KB Output is correct
12 Correct 43 ms 540 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Execution timed out 1100 ms 208400 KB Time limit exceeded
15 Halted 0 ms 0 KB -