oj.uz

Submission #282806

# Submission time Handle Problem Language Result Execution time Memory
282806 2020-08-24T23:57:43 Z Ozy Rail (IOI14_rail) C++17
30 / 100
 84 ms 512 KB 
#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)

void findLocation(int N, int first, int location[], int stype[])
{
    int prim,pos,dis,MIN,a,b;

    MIN = -1;
    rep(i,1,N-1) {
        dis = getDistance(0,i);
        if (MIN == -1 || dis < MIN) {
            MIN = dis;
            pos = first + dis;
            prim = i;
        }
    }

    location[0] = first;
    location[prim] = pos;
    stype[0] = 1;
    stype[prim] = 2;

    rep(i,1,N-1) {
        if (i != prim) {

            a = getDistance(0,i);
            b = getDistance(prim,i);

            if (a < b) {
                location[i] = first + a;
                stype[i] = 2;
            }
            else {
                location[i] = pos - b;
                stype[i] = 1;
            }

        }
    }
}

Compilation message

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:21:14: warning: 'prim' may be used uninitialized in this function [-Wmaybe-uninitialized]
   21 |     location[prim] = pos;
      |              ^~~~
rail.cpp:21:20: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
   21 |     location[prim] = pos;
      |     ~~~~~~~~~~~~~~~^~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 376 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #3
0 / 26.0

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

Subtask #4
0 / 44.0

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