1474E - What Is It - CodeForces Solution


constructive algorithms greedy *2500

Please click on ads to support us..

Python Code:

for tests in range(int(input())):
    n=int(input());AA=[(1,i) for i in range((n+2)//2,n)] + [(i,n) for i in range((n+2)//2-1,0,-1)];L=list(range(1,n+1));sc=0
    for x,y in AA[::-1]:L[x-1],L[y-1]=L[y-1],L[x-1];sc+=(x-y)**2
    print(sc);print(*L);print(len(AA))
    for x,y in AA:print(y,x) if L[x-1]==y else print(x,y);L[x-1],L[y-1]=L[y-1],L[x-1]
			 	    	   	 	  			   	  				


Comments

Submit
0 Comments
More Questions

41C - Email address
1373D - Maximum Sum on Even Positions
1574C - Slay the Dragon
621A - Wet Shark and Odd and Even
1395A - Boboniu Likes to Color Balls
1637C - Andrew and Stones
1334B - Middle Class
260C - Balls and Boxes
1554A - Cherry
11B - Jumping Jack
716A - Crazy Computer
644A - Parliament of Berland
1657C - Bracket Sequence Deletion
1657B - XY Sequence
1009A - Game Shopping
1657A - Integer Moves
230B - T-primes
630A - Again Twenty Five
1234D - Distinct Characters Queries
1183A - Nearest Interesting Number
1009E - Intercity Travelling
1637B - MEX and Array
224A - Parallelepiped
964A - Splits
1615A - Closing The Gap
4C - Registration System
1321A - Contest for Robots
1451A - Subtract or Divide
1B - Spreadsheet
1177A - Digits Sequence (Easy Edition)