제출 #1304500

#제출 시각아이디문제언어결과실행 시간메모리
1304500dang_minh_ducRotating Lines (APIO25_rotate)C++20
0 / 100
2 ms840 KiB
#include <bits/stdc++.h> #include <vector> using namespace std; void rotate(std::vector<int> t, int x); const int INF=50000, need=25000; int acute(int i, int j) {return min(abs(i-j), INF-abs(i-j));} void energy(int n, std::vector<int> v) { int d=acute(v[0], v[1]); if (d!=need) { int i=0, j=1, m=need-acute(v[0], v[1]); if (v[0]<v[1]) swap(i, j); if (v[i]+m<INF) { rotate({i}, m); } else if (v[j]-m>=0) { rotate({j}, INF-m); } else { m-=INF-v[i]; rotate({i}, INF-1-v[i]); rotate({j}, INF-m); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...