제출 #1058591

#제출 시각아이디문제언어결과실행 시간메모리
1058591kachim2Make them Meet (EGOI24_makethemmeet)C++17
10 / 100
0 ms348 KiB
#include<bits/stdc++.h> using namespace std; vector<vector<int>> graph; int main(){ int n, m; 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); } 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 << ' '; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...