Submission #1175806

#TimeUsernameProblemLanguageResultExecution timeMemory
1175806natnichaMemory (IOI10_memory)C++20
100 / 100
0 ms392 KiB
#include "grader.h" #include "memory.h" struct pair{ char first; int second; }; void play() { struct pair arr[51]; for(int i=1;i<=25;i++){ arr[i*2].first=faceup(i*2); arr[i*2-1].first=faceup(i*2-1); arr[i*2].second=i*2; arr[i*2-1].second=i*2-1; } for(int i=50;i>=2;i--){ for(int j=2;j<=i;j++){ if(arr[j].first<arr[j-1].first){ //printf("%c %c\n",arr[j].first,arr[j-1].first); char t=arr[j].first; arr[j].first=arr[j-1].first; arr[j-1].first=t; int tt=arr[j].second; arr[j].second=arr[j-1].second; arr[j-1].second=tt; } } } for(int i=1;i<=25;i++){ //printf("%c %c\n",arr[i*2].first,arr[i*2-1].first); faceup(arr[i*2].second); faceup(arr[i*2-1].second); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...