제출 #145117

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
145117		Radugnn	Alkemija (COCI18_alkemija)	C++14	80 / 80	195 ms	12028 KiB

alkemija

#include <iostream>
#include <deque>
#include <vector>
using namespace std;
struct reactie{
    int L;
    int R;
    int nec;
    vector<int> REZ;
}e[100010];
deque<int> q;
vector<int> Lista[100010];
int N,M,x,C[100010],viz[100010],K,i,j,ec,sol,react,el;
int main(){
    cin>>N>>M;
    for(i=1;i<=M;i++){
        cin>>x;
        C[x]=1;
}
    cin>>K;
    for(i=1;i<=K;i++){
        cin>>e[i].L>>e[i].R;
        e[i].nec=e[i].L;

        for (j=1;j<=e[i].L;j++) {
            cin>>x;
            Lista[x].push_back(i);
            if (C[x]) {
                e[i].nec--;
                if (e[i].nec==0) {
                    q.push_back(i);
                    viz[i] = 1;
                }
            }
        }
        for (j=1;j<=e[i].R;j++) {
            cin>>x;
            e[i].REZ.push_back(x);
        }
    }
    while (!q.empty()) {
            el=q.front();
            q.pop_front();
        for (i=0;i<e[el].REZ.size();i++) {
            ec = e[el].REZ[i];
            if (C[ec]==0) {
                C[ec]=1;

                for (j=0;j<Lista[ec].size();j++) {
                    react=Lista[ec][j];
                    if (viz[react]==0) {
                        e[react].nec--;
                        if (e[react].nec==0) {
                            q.push_back(react);
                            viz[react]=1;
                        }
                    }
                }
            }
        }
    }
    for (i=1;i<=N;i++)
        if (C[i])
            sol++;
    cout<<sol<<"\n";
    for (i=1;i<=N;i++)
        if (C[i])
            cout<<i<<" ";
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

alkemija.cpp: In function 'int main()':
alkemija.cpp:44:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i=0;i<e[el].REZ.size();i++) {
                  ~^~~~~~~~~~~~~~~~~
alkemija.cpp:49:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (j=0;j<Lista[ec].size();j++) {
                          ~^~~~~~~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 8 / 8
• Subtask 5: 8 / 8
• Subtask 6: 8 / 8
• Subtask 7: 8 / 8
• Subtask 8: 8 / 8
• Subtask 9: 8 / 8
• Subtask 10: 8 / 8