| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1338375 | spuike | 세계 지도 (IOI25_worldmap) | C++20 | 2 ms | 580 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
vector<vector<int>>create_map(int n, int m, vector<int>a, vector<int>b){
if(m==n-1){
bool bilo=0;
for(int i=0;i<m;i++){
if(a[i]!=i+1 || b[i]!=i+2){
bilo=1;
break;
}
}
if(!bilo){
vector<vector<int>>ans(n, vector<int>(n));
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
ans[i][j]=i+1;
}
}
return ans;
}
}
if(m==n*(n-1)/2){
vector<int>c;
vector<vector<int>>ans(n, vector<int>(n));
for(int i=1;i<=n;i++)c.push_back(i);
ans[0]=c;
for(int i=1;i<n;i++){
for(int j=0;j<n;j++){
if(i<j+1)ans[i][j]=i;
else ans[i][j]=i+1;
}
}
return ans;
}
}
/*int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, m;
cin>>n>>m;
vector<int>a(n), b(m);
for(int i=0;i<m;i++)cin>>a[i];
for(int i=0;i<m;i++)cin>>b[i];
vector<vector<int>>ans=create_map(n, m, a, b);
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cout<<ans[i][j]<<" ";
}
cout<<'\n';
}
return 0;
}*/
컴파일 시 표준 에러 (stderr) 메시지
| # | 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... | ||||
