oj.uz

Submission #889016

# Submission time Handle Problem Language Result Execution time Memory
889016 2023-12-18T15:28:31 Z aguss Rail (IOI14_rail) C++14
0 / 100
 45 ms 604 KB 
#include "rail.h"
#include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#define endl "\n"
#define sp " "
#define f1(i, x) for(auto &i : x)
#define f2(i, x) for(ll i = 0; i < x; i++)
#define raya() cout << endl << "====================================" << endl
using namespace std;
typedef long long ll;
void findLocation(int N, int first, int location[], int stype[]){
    vector<pair<int, int>> a;
    for(int i = 0; i < N; i++) a.push_back({getDistance(0, i), i});
    sort(a.begin(), a.end());
    int f = a[0].second;
    set<int> b;
    for(int i = 0; i < N; i++){
        if(getDistance(f, i) != getDistance(0, i) - getDistance(0, f))
            b.insert(i);
    }
    for(int i = 0; i < N; i++){
        if(b.find(i) != b.end()){
            location[i] = first + getDistance(0, f) - getDistance(f, i);
            stype[i] = 1;
        } 
        else {
            location[i] = first + getDistance(0, i);
            stype[i] = 2;
        }
    }
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 44 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Incorrect 45 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -