답안 #1066546

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1066546	2024-08-20T01:03:04 Z	aaaaaarroz	축구 경기장 (IOI23_soccer)	C++17	컴파일 오류	0 ms	0 KB

soccer

#include <bits/stdc++.h>
using namespace std;
int biggest_stadium(int N, vector<vector<int>> F){
	map<tuple<int,int,int>,bool>libre;
	for(int fila=0;fila<N;fila++){
		for(int i=0;i<N;i++){
			for(int j=i;j<N;j++){
				if(i==j){
					libre[{fila,i,j}]=!F[fila][j];
				}
				else{
					libre[{fila,i,j}]=(!F[fila][j])&&libre[{fila,i,j-1}];
				}
			}
		}
	}
	int best=0;
	for(int fila=0;fila<N;fila++){
		for(int columna=0;columna<N;columna++){
			for(int i=0;i<=columna;i++){
				for(int j=columna;j<N;j++){
					if(libre[{fila,i,j}]){
						vector<pair<int,int>>almacen;
						almacen.push_back({i,j});
						int suma=0;
						int fil=fila-1;
						while(fil>=0&&F[fil][columna]!=1){
							int l=columna,r=columna;
							while(true){
								if(libre[{fil,l-1,r}]&&(l-1)>=almacen.back().first){
									l--;
								}
								else if(libre[{fil,l,r+1}]&&(r+1)<=almacen.back().second){
									r++;
								}
								else{
									break;
								}
							}
							almacen.push_back({l,r});
							fil--;
						}
						almacen.push_back({i,j});
						fil=fila+1;
						int fila_extra=1;
						int alm_ant=almacen.size()-1;
						while(fil<N&&F[fil][columna]!=1){
							if(fila_extra<alm_ant){
								int l1=almacen[fila_extra].first,r1=almacen[fila_extra].second;
								while(true){
									if(libre[{fil,l1-1,r1}]&&(l1-1)>=almacen.back().first&&(l1-1)>=almacen[fila_extra-1].first){
										l1--;
									}
									else if(libre[{fil,l1,r1+1}]&&(r1+1)<=almacen.back().second&&(r1+1)<=almacen[fila_extra-1].second){
										r1++;
									}
									else{
										break;
									}
								}
								int l2=almacen[fila_extra-1].first,r2=almacen[fila_extra-1].second;
								while(true){
									if(libre[{fil,l1-1,r1}]&&(l1-1)>=almacen.back().first){
										l1--;
									}
									else if(libre[{fil,l1,r1+1}]&&(r1+1)<=almacen.back().second){
										r1++;
									}
									else{
										break;
									}
								}
								int l=columna,r=columna;
								while(true){
									if(libre[{fil,l-1,r}]&&(l-1)>=almacen[fila_extra].first&&(l-1)>=almacen.back().first&&(l-1)>=almacen[fila_extra-1].first){
										l--;
									}
									else if(libre[{fil,l,r+1}]&&(r+1)<=almacen[fila_extra].second&&(r+1)<=almacen.back().second&&(r+1)<=almacen[fila_extra-1].second){
										r++;
									}
									else{
										break;
									}
								}
								if(libre[{fil,l2,r2}]&&l2>=almacen.back().first&&r2<=almacen.back().second){
									almacen.push_back({l2,r2});
								}
								else if(libre[{fil,l1,r1}]&&l1>=almacen.back().first&&r1<=almacen.back().second&&l1>=almacen[fila_extra-1].first&&r1<=almacen[fila_extra-1].second){
									almacen.push_back({l1,r1});
								}
								else{
									almacen.push_back({l,r});
								}
							}
							else if(fila_extra==alm_ant){
								int l=columna,r=columna;
								while(true){
									if(libre[{fil,l-1,r}]&&(l-1)>=almacen.back().first&&(l-1)>=almacen[fila_extra-1].first){
										l--;
									}
									else if(libre[{fil,l,r+1}]&&(r+1)<=almacen.back().second&&(r+1)<=almacen[fila_extra-1].second){
										r++;
									}
									else{
										break;
									}
								}
								int l2=almacen[fila_extra-1].first,r2=almacen[fila_extra-1].second;
								while(true){
									if(libre[{fil,l1-1,r1}]&&(l1-1)>=almacen.back().first){
										l1--;
									}
									else if(libre[{fil,l1,r1+1}]&&(r1+1)<=almacen.back().second){
										r1++;
									}
									else{
										break;
									}
								}
								if(libre[{fil,l2,r2}]&&l2>=almacen.back().first&&r2<=almacen.back().second){
									almacen.push_back({l2,r2});
								}
								else{
									almacen.push_back({l,r});
								}
							}
							else{
								int l=columna,r=columna;
								while(true){
									if(libre[{fil,l-1,r}]&&(l-1)>=almacen.back().first){
										l--;
									}
									else if(libre[{fil,l,r+1}]&&(r+1)<=almacen.back().second){
										r++;
									}
									else{
										break;
									}
								}
								almacen.push_back({l,r});
							}
							fil++;
							fila_extra++;
						}
						for(auto[x,y]:almacen){
							suma+=(y-x+1);
						}
						suma-=(j-i+1);
						best=max(suma,best);
					}
					else{
						continue;
					}
				}
			}
		}
	}
	return best;
}
/*
int main()
{
    int N;
    cin>>N;
    vector<vector<int>> F(N, vector<int>(N));
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            cin>>F[i][j];
        }
    }
    int res = biggest_stadium(N, F);
	cout<<res<<"\n";
    return 0;
}
*/

Compilation message

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:110:24: error: 'l1' was not declared in this scope; did you mean 'l2'?
  110 |          if(libre[{fil,l1-1,r1}]&&(l1-1)>=almacen.back().first){
      |                        ^~
      |                        l2
soccer.cpp:110:29: error: 'r1' was not declared in this scope; did you mean 'r2'?
  110 |          if(libre[{fil,l1-1,r1}]&&(l1-1)>=almacen.back().first){
      |                             ^~
      |                             r2
soccer.cpp:110:18: error: no match for 'operator[]' (operand types are 'std::map<std::tuple<int, int, int>, bool>' and '<brace-enclosed initializer list>')
  110 |          if(libre[{fil,l1-1,r1}]&&(l1-1)>=almacen.back().first){
      |                  ^
In file included from /usr/include/c++/10/map:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:81,
                 from soccer.cpp:1:
/usr/include/c++/10/bits/stl_map.h:492:7: note: candidate: 'std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::tuple<int, int, int>; _Tp = bool; _Compare = std::less<std::tuple<int, int, int> >; _Alloc = std::allocator<std::pair<const std::tuple<int, int, int>, bool> >; std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type = bool; std::map<_Key, _Tp, _Compare, _Alloc>::key_type = std::tuple<int, int, int>]'
  492 |       operator[](const key_type& __k)
      |       ^~~~~~~~
/usr/include/c++/10/bits/stl_map.h:492:34: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const std::tuple<int, int, int>&'}
  492 |       operator[](const key_type& __k)
      |                  ~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_map.h:512:7: note: candidate: 'std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](std::map<_Key, _Tp, _Compare, _Alloc>::key_type&&) [with _Key = std::tuple<int, int, int>; _Tp = bool; _Compare = std::less<std::tuple<int, int, int> >; _Alloc = std::allocator<std::pair<const std::tuple<int, int, int>, bool> >; std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type = bool; std::map<_Key, _Tp, _Compare, _Alloc>::key_type = std::tuple<int, int, int>]'
  512 |       operator[](key_type&& __k)
      |       ^~~~~~~~
/usr/include/c++/10/bits/stl_map.h:512:29: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::map<std::tuple<int, int, int>, bool>::key_type&&' {aka 'std::tuple<int, int, int>&&'}
  512 |       operator[](key_type&& __k)
      |                  ~~~~~~~~~~~^~~
soccer.cpp:113:23: error: no match for 'operator[]' (operand types are 'std::map<std::tuple<int, int, int>, bool>' and '<brace-enclosed initializer list>')
  113 |          else if(libre[{fil,l1,r1+1}]&&(r1+1)<=almacen.back().second){
      |                       ^
In file included from /usr/include/c++/10/map:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:81,
                 from soccer.cpp:1:
/usr/include/c++/10/bits/stl_map.h:492:7: note: candidate: 'std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::tuple<int, int, int>; _Tp = bool; _Compare = std::less<std::tuple<int, int, int> >; _Alloc = std::allocator<std::pair<const std::tuple<int, int, int>, bool> >; std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type = bool; std::map<_Key, _Tp, _Compare, _Alloc>::key_type = std::tuple<int, int, int>]'
  492 |       operator[](const key_type& __k)
      |       ^~~~~~~~
/usr/include/c++/10/bits/stl_map.h:492:34: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const std::tuple<int, int, int>&'}
  492 |       operator[](const key_type& __k)
      |                  ~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_map.h:512:7: note: candidate: 'std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](std::map<_Key, _Tp, _Compare, _Alloc>::key_type&&) [with _Key = std::tuple<int, int, int>; _Tp = bool; _Compare = std::less<std::tuple<int, int, int> >; _Alloc = std::allocator<std::pair<const std::tuple<int, int, int>, bool> >; std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type = bool; std::map<_Key, _Tp, _Compare, _Alloc>::key_type = std::tuple<int, int, int>]'
  512 |       operator[](key_type&& __k)
      |       ^~~~~~~~
/usr/include/c++/10/bits/stl_map.h:512:29: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::map<std::tuple<int, int, int>, bool>::key_type&&' {aka 'std::tuple<int, int, int>&&'}
  512 |       operator[](key_type&& __k)
      |                  ~~~~~~~~~~~^~~