제출 #1058651

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1058651		kachim2	Make them Meet (EGOI24_makethemmeet)	C++17	34 / 100	4 ms	604 KiB

Main

#include<bits/stdc++.h>
using namespace std;
vector<vector<int>> graph;
int n, m;
void pathlike(){
    cout << "600\n";
    for(int i = 0; i < 600; i++){
        for(int j = 0; j < n; j++){
            cout << (j+(i%2))/2 << ' ';
            
        }
        cout << '\n';
    }
}
void star(){
    cout << 3 << '\n';
    cout << 1 << ' ' << 1 << ' ';
    for(int i = 2; i < n; i++){
        cout << 1 << ' ';
    }
    cout << '\n';
    cout << 0 << ' ' << 0 << ' ';
    for(int i = 2; i < n; i++){
        cout << 1 << ' ';
    }
    cout << '\n';
        cout << 1 << ' ' << 1 << ' ';
    for(int i = 2; i < n; i++){
        cout << 1 << ' ';
    }
}
int main(){
    cin >> n >> m;
    graph.resize(n);
    for(int i = 0; i < m; i++){
        int x, y;
        cin >> x >> y;
        graph[x].push_back(y);
        graph[y].push_back(x);
    }
    if(graph[0].size() == n-1 && graph[1].size() == 1){
        star();
    }else{
        pathlike();
    }


    
}

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

Main.cpp: In function 'int main()':
Main.cpp:41:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   41 |     if(graph[0].size() == n-1 && graph[1].size() == 1){
      |        ~~~~~~~~~~~~~~~~^~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 13 / 13
• Subtask 3: 11 / 11
• Subtask 4: 0 / 36
• Subtask 5: 0 / 30