Submission #1196675

#	Time	Username	Problem	Language	Result	Execution time	Memory
1196675		amanthaband	Arranging Shoes (IOI19_shoes)	C++20	0 / 100	0 ms	328 KiB

shoes

#include <cmath>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include "shoes.h"

using namespace std;

bool isvalid(vector<int> s){
    for (int i = 0; i < s.size() -1; i+=2)
    {
        if(s[i] == abs(s[i]) && s[i] < s[i+1]);
        return true;
    }
    return false;
}
long long count_swaps(vector<int> s) {
    int n = s.size();
    int cnt = 0;
    for (int j = 0; j < n; j++)
    {
        if (isvalid(s))
        {
            return cnt;
        }
        
        else{
            for (int i = 0; i < n-1; i+=2)
        {
            if(s[i] != s[i+1] || s[i+1] != abs(s[i]) ){
                swap(s[i],s[i+1]);
                cnt++;
            }
            if(s[i+1] == abs(s[i])){
                if(s[i] < s[i+1]){
                    continue;
                }
                else{
                    swap(s[i],s[i+1]);
                    cnt++;
                }
            }
            
        }
        }
    
        
    }

	return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15