Submission #1237221

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237221		opeleklanos	Kutije (COCI21_kutije)	C++20	35 / 70	1095 ms	8336 KiB

Main

#include <iostream>
#include <vector>
using namespace std;

vector<vector<int>> moves;
vector<vector<int>> dp;
int n, m, q;

int makeDp(int toy, int box){
    if(toy == box) return dp[toy][box] = 1;
    if(dp[toy][box] == 2) return 0;
    if(dp[toy][box] != -1) return dp[toy][box];

    dp[toy][box] = 2;
    for(int i = 1; i<=m; i++){
        if(makeDp(toy, moves[i][box]) == 1){
            dp[toy][box] = 1;
            break;
        }
    }
    if(dp[toy][box] == 2 ) dp[toy][box] = 0;
    return dp[toy][box];
}

int main(void){
    //freopen("input.txt", "r", stdin);
    cin>>n>>m>>q;
    moves.assign(m+1, vector<int>(n+1, 0));
    dp.assign(n+1, vector<int>(n+1, -1));

    for(int i = 1; i<=m; i++){
        for(int j = 1; j<=n; j++) cin>>moves[i][j];
    }

    for(int i = 0; i<q; i++){
        int t, b;
        cin>>t>>b;
        if(makeDp(t, b)) cout<<"DA\n";
        else cout<<"NE\n";
    }
    return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 0 / 35