제출 #623189

#제출 시각아이디문제언어결과실행 시간메모리
623189PanTkdArranging Shoes (IOI19_shoes)C++14
컴파일 에러
0 ms0 KiB
// // main.cpp // // Created by Panagiotis Chadjicostas on // Copyright © Panagiotis Hadjicostas. All rights reserved. // #include <iostream> #include <algorithm> #include <bitset> #include <complex> #include <deque> #include <fstream> #include <iomanip> #include <iterator> #include <limits> #include <list> #include <cstring> #include <map> #include <queue> #include <set> #include <stack> #include <string> #include <vector> #include <unordered_map> using namespace std; typedef long long ll; typedef vector<ll> vi; typedef pair<ll,ll> ii; #define fo(i,a,b) for(int i = a; i<=b; i++) #define f(i,b) for(int i=0;i<b;i++) #define F first #define S second #define sz size #define ls s,m,idx<<1 #define rs m+1,e,idx<<1|1 const ll MOD=ll(1e9)+7; const ll MAXN=2*ll(1e6); void checker(){ ll n=rand()%20+2; vi a(n,ll()); for(ll i=0;i<n;i++){ a[i]=rand()%20+2; } for(ll b=0;b<(1<<n);b++){ vi on,off; for(ll i=0;i<n;i++){ if(i&(1<<i)){ on.push_back(i); } else{ off.push_back(i); } } } } /////////////////////////////////////////////////////////////////////// struct shoes{ int s; bool r; } long long count_swaps(vector <int> S) { ll n=S.size(); shoes A[n]; for(ll i=0;i<n;i++){ A[i].s=abs(S[i]); A[i].r=(S[i]>0); } if(A[0].r==0)return 0; return 1; }

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

shoes.cpp:64:2: error: expected ';' after struct definition
   64 | }
      |  ^
      |  ;