Submission #1304506

#	Time	Username	Problem	Language	Result	Execution time	Memory
1304506		siquy3001	Rotating Lines (APIO25_rotate)	C++20	16 / 100	43 ms	3812 KiB

rotate

#include <vector>
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
void rotate(std::vector<int> t, int x);
void energy(int n, std::vector<int> v) {
	vector<pair<ll,ll>>a;
	for(int i=0;i<n;i++){
		a.push_back({v[i],i});
	}
	sort(a.begin(),a.end());
	for(int i=n-1;i>=n-1-n/2+1;i--){
		rotate({a[i].second},a[0].first+75000-a[i].first);
	}
	for(int i=1;i<n-1-n/2+1;i++)rotate({a[i].second},a[0].first-a[i].first+50000);
}

Compilation message (stderr)

rotate.cpp: In function 'void energy(int, std::vector<int>)':
rotate.cpp:13:30: warning: narrowing conversion of 'a.std::vector<std::pair<long long int, long long int> >::operator[](((std::vector<std::pair<long long int, long long int> >::size_type)i)).std::pair<long long int, long long int>::second' from 'long long int' to 'int' [-Wnarrowing]
   13 |                 rotate({a[i].second},a[0].first+75000-a[i].first);
rotate.cpp:13:30: warning: narrowing conversion of 'a.std::vector<std::pair<long long int, long long int> >::operator[](((std::vector<std::pair<long long int, long long int> >::size_type)i)).std::pair<long long int, long long int>::second' from 'long long int' to 'int' [-Wnarrowing]
rotate.cpp:15:50: warning: narrowing conversion of 'a.std::vector<std::pair<long long int, long long int> >::operator[](((std::vector<std::pair<long long int, long long int> >::size_type)i)).std::pair<long long int, long long int>::second' from 'long long int' to 'int' [-Wnarrowing]
   15 |         for(int i=1;i<n-1-n/2+1;i++)rotate({a[i].second},a[0].first-a[i].first+50000);
rotate.cpp:15:50: warning: narrowing conversion of 'a.std::vector<std::pair<long long int, long long int> >::operator[](((std::vector<std::pair<long long int, long long int> >::size_type)i)).std::pair<long long int, long long int>::second' from 'long long int' to 'int' [-Wnarrowing]

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