Submission

Score: 80

User: anonymous

Problemset: Internal Order

Language: cpp

Time: 0.002 second

Submitted On: 2026-10-08 17:23:18

#include <bits/stdc++.h>
using namespace std;
    struct godtham{
        string name;
        int altar;
    };

int main(){
    int n;cin >> n;
    godtham god[4]; 
    for(int i=0;i<4;i++) 
    {
        cin >> god[i].name;
        god[i].altar = i+1;
    }
    
    for(int i = 0;i<3;i++){
        for(int j =i+1;j<4;j++)
        {
            if(god[i].name > god[j].name)swap(god[i],god[j]);
        }
    }
    
    int order[4];
    
    for(int i=0;i<4;i++){
        int pos = (n-1+i) % 4;
        order[i] = god[pos].altar;
    }
    
    int pos[5];
    
    for(int i=0;i<4;i++){
        pos[order[i]] = i + 1;
    }
    
    bool omega; omega = (pos[2]  == 1 || n == 1); if (pos[4] < pos[3]) omega = false;

    bool mu; mu = (pos[3] > pos[2] && pos[3] < pos[1] && pos[4] != 3);

    bool xi; if(pos[2] != 4) xi = true;

bool open;
open = xi && (pos[4] < pos[2] || pos[3] > pos[1]);
if (open) {
        cout << "CROISSANT with ordering: ";
        for (int i = 0; i < 4; i++) cout << order[i] << ' ';
}
    else  cout << "No Croissant :(";
}