#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N,S,T;
cin>>N>>S>>T;
vector<vector<int>> a(N, vector<int>(S));
for(int i=0;i<N;i++)
for(int j=0;j<S;j++)
cin>>a[i][j];
// sort each core’s submissions
for(int i=0;i<N;i++)
sort(a[i].begin(), a[i].end());
// rotate each row by its core index
for(int i=0;i<N;i++){
for(int j=0;j<S;j++){
int k = (j + i) % S;
cout<<a[i][k]<<(j+1==S?'\n':' ');
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |