제출 #1293514

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1293514		lizi14	World Map (IOI25_worldmap)	C++20	0 / 100	1 ms	572 KiB

worldmap

#include "worldmap.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;
vector<int>j;
//const int N1=50;
vector<int>v[50];
//#include "worldmap.h"
vector<int>x;
void dfs(int a,int bati){
    //x[a]=1;
    j.push_back(a);
    for (int k:v[a]) {
        if(x[k]!=1 && k!=bati) {
            dfs(k,a);
            j.push_back(a);
        }
    }
}
vector<vector<int>>create_map(int N, int M,vector<int> A,vector<int> B) {
    for(int i=0; i<=50; i++){
        v[i].clear();
    }
    j.clear();
    //  for(int i=0;i<=N; i++) {
    //     if(x[i]==0)dfs(i, -1);
    // }
    dfs(1,0);
    int batiii=j.size();
    vector<vector<int>> ans(batiii, vector<int>(batiii));
    for(int i=0; i<j.size(); i++){
        for(int drnachvi=0; drnachvi<j.size(); drnachvi++){
            ans[drnachvi][i]=j[i];
            //cout<<ans[drnachvi][i]<<" ";
        }
        //cout<<endl;
    }
    
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

In file included from /usr/include/c++/13/vector:66,
                 from worldmap.h:1,
                 from worldmap.cpp:1:
In member function 'constexpr void std::vector<_Tp, _Alloc>::clear() [with _Tp = int; _Alloc = std::allocator<int>]',
    inlined from 'std::vector<std::vector<int> > create_map(int, int, std::vector<int>, std::vector<int>)' at worldmap.cpp:23:19:
/usr/include/c++/13/bits/stl_vector.h:1606:24: warning: iteration 50 invokes undefined behavior [-Waggressive-loop-optimizations]
 1606 |       { _M_erase_at_end(this->_M_impl._M_start); }
      |         ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
worldmap.cpp: In function 'std::vector<std::vector<int> > create_map(int, int, std::vector<int>, std::vector<int>)':
worldmap.cpp:22:19: note: within this loop
   22 |     for(int i=0; i<=50; i++){
      |                  ~^~~~

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 7
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 56