제출 #679815

#제출 시각아이디문제언어결과실행 시간메모리
679815viciousArranging Shoes (IOI19_shoes)C++17
컴파일 에러
0 ms0 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; using ll = long long; typedef pair<int,int> pi; typedef tuple<int,int,int> ti; template<typename T> bool chmin(T &a, T b){return (b < a) ? a = b, 1 : 0;} template<typename T> bool chmax(T &a, T b){return (b > a) ? a = b, 1 : 0;} void debug_out() {cerr<<endl;} template <typename Head, typename... Tail> void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);} #define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__) const int N = 100010*2; int n,arr[N],from[N],vis[N]; map<int,vector<int>> p; ll ans; ll fw[N], fw2[N]; void update(int x, int y, int v) { //inclusive for (int tx=x; tx < N; tx += tx&(-tx)) fw[tx] += v, fw2[tx] -= v*(x-1); for (int ty=y+1; ty < N; ty += ty&(-ty)) fw[ty] -= v, fw2[ty] += v*y; } ll sum (int x) { ll res = 0; for (int tx=x; tx; tx -= tx&(-tx)) res += fw[tx]*x + fw2[tx]; return res; } ll query(int x, int y) { //inclusive return sum(y)-sum(x-1); } long long count_swaps(std::vector<int> s) { n = s.size(); for (int i = 1; i <= n; ++i) arr[i]=s[i-1]; for (int i = n; i >= 1; --i) { update(i,i,i); p[arr[i]].push_back(i); if (!p[-arr[i]].size()) continue; from[i] = p[-arr[i]].back(); } for (int i = 1; i <= n; ++i) { if (!from[i] || vis[i]) continue; int rx = query(from[i],from[i]); int lx = query(i,i); int actual = abs(arr[i])*(lx%2?-1:1); ans += rx-lx+(actual!=arr[i])-1; update(1,from[i],1); vis[from[i]]=1;2 } return ans; }

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

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:48:25: error: expected ';' before '}' token
   48 |         vis[from[i]]=1;2
      |                         ^
      |                         ;
   49 |     }
      |     ~                    
shoes.cpp:48:24: warning: statement has no effect [-Wunused-value]
   48 |         vis[from[i]]=1;2
      |                        ^