131682025-01-06 19:57:11ercseferencTom és Jerry 1 (80)cpp17Time limit exceeded 64/80600ms6112 KiB
#include <bits/stdc++.h>
using namespace std;
struct pont{vector<int>tom,jerry; int tomt=100001,jerryt=0;
    bool van=0;};;
int main()
{
    int n,m,tomi,k,lyuk; //ifstream f("szamok.txt");
    cin>>n>>m>>tomi>>k>>lyuk;
    pont a[n+1]; int x,y,z;
    for(int i=0; i<m; i++){cin>>x>>y>>z;
        a[x].jerry.push_back(y); a[y].jerry.push_back(x);
        if(z==2){a[x].tom.push_back(y); a[y].tom.push_back(x);}}
    vector<int>l1,l2; bool nincs=0; l1.push_back(tomi); int p=0;
    a[tomi].tomt=0; a[tomi].van=1;
    while(!nincs){
        p++;
        for(int i=0; i<l1.size(); i++){
            for(int j=0; j<a[l1[i]].tom.size(); j++){
                if(a[a[l1[i]].tom[j]].van==0){
                    a[a[l1[i]].tom[j]].van=1;
                    a[a[l1[i]].tom[j]].tomt=p;
                    l2.push_back(a[l1[i]].tom[j]);}}}
        if(l2.size()==0)nincs=1;
        l1.clear(); l1=l2; l2.clear();}
    int jerri; bool igene[k];
    for(int i=0; i<k; i++){
        for(int i=1; i<=n; i++){a[i].van=0;}
        cin>>jerri; l1.clear(); l2.clear(); nincs=0;
        a[jerri].van=1; a[jerri].jerryt=0; l1.push_back(jerri); p=0;
            while(!nincs){
            p++;
            for(int i=0; i<l1.size(); i++){
                for(int j=0; j<a[l1[i]].jerry.size(); j++){
                    if(a[a[l1[i]].jerry[j]].van==0 && p<a[a[l1[i]].jerry[j]].tomt){
                        a[a[l1[i]].jerry[j]].van=1; l2.push_back(a[l1[i]].jerry[j]);}}}
            if(l2.size()==0)nincs=1;
            l1.clear(); l1=l2; l2.clear();}
        if(a[lyuk].van)igene[i]=1;
        else igene[i]=0; }
    for(int i=0; i<k; i++){
        if(igene[i])cout<<"IGEN"<<endl;
        else cout<<"NEM"<<endl;}
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base64/80
1Accepted0/01ms316 KiB
2Accepted0/03ms512 KiB
3Accepted4/41ms508 KiB
4Accepted4/41ms316 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms500 KiB
7Accepted4/42ms316 KiB
8Accepted4/43ms316 KiB
9Accepted4/43ms316 KiB
10Accepted4/44ms564 KiB
11Accepted4/49ms836 KiB
12Accepted4/414ms1484 KiB
13Accepted4/426ms1656 KiB
14Accepted4/450ms3084 KiB
15Accepted4/476ms3332 KiB
16Accepted4/485ms6112 KiB
17Accepted4/4129ms5428 KiB
18Accepted4/478ms4152 KiB
19Time limit exceeded0/4583ms5164 KiB
20Time limit exceeded0/4600ms5316 KiB
21Time limit exceeded0/4587ms3884 KiB
22Time limit exceeded0/4600ms5484 KiB