Submission #1213094

#	Time	Username	Problem	Language	Result	Execution time	Memory
1213094		Rawlat_vanak	Rotating Lines (APIO25_rotate)	C++20	0 / 100	88 ms	8776 KiB

rotate

#include "rotate.h"
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define speedIO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define mod 1000000007
#define f first
#define s second
#define pii pair<int,int>
#define pb push_back

const int M=50000;

vector<int> final;


void energy(int n, vector<int> v){
	vector<pii> w(n);
	for(int i=0;i<n;i++){
		w[i]={v[i],i};
	}
	sort(w.begin(),w.end());
	set<pair<pii,int>> a;
	for(int i=0;i<n;i++){
		a.insert({{w[i].f,i},w[i].s});
	}
	//will work with w, w[i].s is the og index.
	// a.f.f is value, a.f.s is the sorted index and a.s is the og index.
	int idx=0;
	vector<bool> marked(n,false);
	while(idx<n){
		if(marked[idx]){
			idx++;
			continue;
		}
		marked[idx]=true;
		if(w[idx].f<M/2){
			auto it=a.upper_bound({{w[idx].f+M/2,1e9},1e9});
			it--; // j st w[j]<=w[i]+M/2<w[j+1]
			auto element=*it;
			if(element.f.s-idx>=n/2){
				rotate({w[idx].s},w[element.f.s].f+M/2-w[idx].f);

				a.erase({{w[idx].f,idx},w[idx].s});
				w[idx].f=(w[element.f.s].f+M/2)%M;
				a.insert({{w[idx].f,idx},w[idx].s});
				marked[element.f.s]=true;


			}else{
				rotate({w[idx].s},w[(element.f.s+1)%n].f+M/2-w[idx].f);

				a.erase({{w[idx].f,idx},w[idx].s});
				w[idx].f=(w[(element.f.s+1)%n].f+M/2)%M;
				a.insert({{w[idx].f,idx},w[idx].s});
				marked[(element.f.s+1)%n]=true;
			}
		}else{
			auto it=a.lower_bound({{w[idx].f-M/2,0},0});
			//it--; // j st w[j-1]<w[i]+M/2<=w[j]
			auto element=*it;
			if(idx-element.f.s>=n/2){
				rotate({w[idx].s},w[element.f.s].f+M/2-w[idx].f);

				a.erase({{w[idx].f,idx},w[idx].s});
				w[idx].f=(w[element.f.s].f+M/2)%M;
				a.insert({{w[idx].f,idx},w[idx].s});
				marked[element.f.s]=true;

			}else{
				rotate({w[idx].s},w[(element.f.s-1)%n].f+M/2-w[idx].f);

				a.erase({{w[idx].f,idx},w[idx].s});
				w[idx].f=(w[(element.f.s-1)%n].f+M/2)%M;
				a.insert({{w[idx].f,idx},w[idx].s});
				marked[(element.f.s-1)%n]=true;
			}
		}


		idx++;
	

	}

	
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 8
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 26