Submission #1098090

#TimeUsernameProblemLanguageResultExecution timeMemory
1098090Trisanu_DasMake them Meet (EGOI24_makethemmeet)C++17
10 / 100
2 ms348 KiB
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0)->sync_with_stdio(0); int n, m; cin >> n >> m; vector<int> adj[n]; while(m--){ int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } cout << 2 * n - 1 << '\n'; for(int i = 0; i < n - 1; i++){ for(int j = 0; j < n; j++){ if(j == i + 1) cout << 0 << ' '; else cout << j << ' '; } cout << '\n'; for(int j = 0; j < n; j++){ if(j == i + 1) cout << 0 << ' '; else cout << j << ' '; } cout << '\n'; } for(int i = 0; i < n; i++) cout << 0 << ' '; cout << '\n'; }
#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...