Submission #3709126

---

Source Code Expand

#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<ii,int>
#define iiii pair<ii,ii>
#define sz(x) ((int) x.size())
#define orta ((bas+son)>>1)
#define all(x) x.begin(),x.end()
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define pw(x) (1<<(x))
#define inf 10050000000000000
#define MOD 1000000007
#define N 200005
#define M 1000005
#define LOG 18
#define KOK 32000
using namespace std;

int n,tot;
int tut[N],f[N];
ll ans;
char s[N];
vector<int> pos[26],rpos[26];
vector<ii> v;

void up(int x) {

	for(int i=x;i<=n;i+=(i&-i)) f[i]++;

}

int get(int x) {

	int res=0;

	for(int i=x;i>=1;i-=(i&-i)) res+=f[i];

	return res;

}

int main() {

	//freopen("input.txt","r",stdin);

	scanf("%s",s+1);

	n=strlen(s+1);

	int odd=0;

	for(int i=1;i<=n;i++) {

		pos[s[i]-'a'].pb(i);

		odd-=1-sz(pos[s[i]-'a'])%2;
		odd+=sz(pos[s[i]-'a'])%2;

	}

	if(odd>1) {

		printf("-1");

		return 0;

	}

	for(int i=0;i<26;i++) {

		for(int j=0;j<sz(pos[i])/2;j++) {

			v.pb({pos[i][j],i});

		}

	}

	sort(all(v));

	for(int i=0;i<sz(v);i++) {

		rpos[v[i].nd].pb(++tot);

	}

	if(n%2) {

		for(int i=0;i<26;i++) {

			if(sz(pos[i])&1) {

				rpos[i].pb(++tot);

			}

		}

	}

	for(int i=sz(v)-1;i>=0;i--) {

		rpos[v[i].nd].pb(++tot);

	}

	for(int i=0;i<26;i++) {

		for(int j=0;j<sz(pos[i]);j++) {

			tut[rpos[i][j]]=pos[i][j];

		}

	}

	for(int i=1;i<=n;i++) {

		int apos=i-1-get(tut[i]);

		ans+=abs(tut[i]+apos-i);		

		up(tut[i]);

	}

	printf("%lld",ans);

}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:53:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s+1);
                 ^

Judge Result