제출 #341207

#제출 시각아이디문제언어결과실행 시간메모리
341207YJUArranging Shoes (IOI19_shoes)C++14
컴파일 에러
0 ms0 KiB
#include<bits/stdc++.h> #pragma GCC optimize("unroll-loops,no-stack-protector") using namespace std; typedef int ll; typedef long double ld; typedef pair<ll,ll> pll; const ll MOD=1e9+7; const ll MOD2=998244353; const ll N=1e5+5; const ll K=350; const ld pi=acos(-1); const ll INF=(1LL<<60); #define SQ(i) ((i)*(i)) #define REP(i,n) for(ll i=0;i<n;i++) #define REP1(i,n) for(ll i=1;i<=n;i++) #define pb push_back #define mp make_pair #define X first #define Y second #define setp setprecision #define lwb lower_bound #define SZ(_a) (ll)_a.size() ll bit[N]; void ins(ll id,ll del){ ++id; for(;id;id+=(id&-id)){ bit[id]+=del; } } ll q(ll id){ ++id; ll sum=0; for(;;id-=(id&-id)){ sum+=bit[id]; } return sum; } long long count_swaps(vector<int> s){ long long ans=0; lln=SZ(s); map<ll,queue<ll> > m; REP(i,n){ if(SZ(m[-s[i]])){ ans-=(q(i)-q(m[-s[i]].front())); ans+=i-m[-s[i]].front()-1+(s[i]<0?1:0); ins(m[-s[i]].front(),-1); m[-s[i]].pop(); }else{ ins(i,1); m[s[i]].push(i); } } return ans; }

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

shoes.cpp:12:18: warning: overflow in conversion from 'long long int' to 'll' {aka 'int'} changes value from '1152921504606846976' to '0' [-Woverflow]
   12 | const ll INF=(1LL<<60);
      |              ~~~~^~~~~
shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:44:2: error: 'lln' was not declared in this scope; did you mean 'll'?
   44 |  lln=SZ(s);
      |  ^~~
      |  ll
shoes.cpp:46:8: error: 'n' was not declared in this scope
   46 |  REP(i,n){
      |        ^
shoes.cpp:14:31: note: in definition of macro 'REP'
   14 | #define REP(i,n) for(ll i=0;i<n;i++)
      |                               ^