Submission #1053368

#TimeUsernameProblemLanguageResultExecution timeMemory
1053368LudisseyMake them Meet (EGOI24_makethemmeet)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> #define int long long #define sz(a) (int)a.size() #define all(a) a.begin(), a.end() using namespace std; int N,M,Q; signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> N >> M; vector<pair<int,int>> ed(M); for (int i = 0; i < M; i++) { cin >> ed[i].first >> ed[i].second; if(ed[i].first>ed[i].second) swap(ed[i].first,ed[i].second); } sort(all(ed)); cout << N+(N) << "\n"; for (int i = 0; i < N+1; i++) { if(i<N){ for (int j = 0; j < N; j++) { if(j==i||j==i+1) cout << 0 << ' '; else cout << j+1 << ' '; } cout << '\n'; } if(i>0){ for (int j = 0; j < N; j++) { if(j==i-1||j==i) cout << 0 << ' '; else cout << j+1 << ' '; } if(i<N) cout << '\n'; } } return 0; }
#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...