oj.uz

Submission #770370

# Submission time Handle Problem Language Result Execution time Memory
770370 2023-07-01T06:13:47 Z Plurm Flights (JOI22_flights) C++17
21 / 100
 1156 ms 1940 KB 
#include "Ali.h"
#include <string>
#include <vector>
using namespace std;

namespace {

const int MODX = 1024;
const int MODY = 1024;
int N;
vector<int> g[10005];

} // namespace

int dist(int u, int v, int p = -1) {
    int mn = 1e9;
    if (u == v)
        return 0;
    for (int w : g[u]) {
        if (w == p)
            continue;
        mn = min(mn, dist(w, v, u) + 1);
    }
    return mn;
}

void Init(int N, std::vector<int> U, std::vector<int> V) {
    ::N = N;
    for (int i = 0; i < N; i++)
        SetID(i, i);
    for (int i = 0; i < 10005; i++)
        g[i].clear();
    for (int i = 0; i < N - 1; i++) {
        g[U[i]].push_back(V[i]);
        g[V[i]].push_back(U[i]);
    }
}

std::string SendA(std::string S) {
    int mx = 0;
    int my = 0;
    for (int i = 0; i < 10; i++) {
        if (S[i] == '1')
            mx |= 1 << i;
    }
    for (int i = 0; i < 10; i++) {
        if (S[10 + i] == '1')
            my |= 1 << i;
    }
    std::string out;
    for (int i = 0; i < N; i++) {
        if (i % MODX == mx) {
            for (int j = 0; j < N; j++) {
                if (j % MODY == my) {
                    int d = dist(i, j);
                    for (int b = 0; b < 14; b++) {
                        if (d & (1 << b))
                            out.push_back('1');
                        else
                            out.push_back('0');
                    }
                }
            }
        }
    }
    return out;
}

#include "Benjamin.h"
#include <string>
#include <vector>
using namespace std;

namespace {

const int MODX = 1024;
const int MODY = 1024;
int N, X, Y;

} // namespace

std::string SendB(int N, int X, int Y) {
    ::N = N;
    ::X = X;
    ::Y = Y;
    int mx = X % MODX;
    int my = Y % MODY;
    std::string msg;
    for (int i = 0; i < 10; i++) {
        if (mx & (1 << i))
            msg.push_back('1');
        else
            msg.push_back('0');
    }
    for (int i = 0; i < 10; i++) {
        if (my & (1 << i))
            msg.push_back('1');
        else
            msg.push_back('0');
    }
    return msg;
}

int Answer(std::string T) {
    int mx = X % MODX;
    int my = Y % MODY;
    int c = 0;
    for (int i = 0; i < N; i++) {
        if (i % MODY == mx) {
            for (int j = 0; j < N; j++) {
                if (j % MODY == my) {
                    if (i == X && j == Y) {
                        goto NXT;
                    }
                    c += 14;
                }
            }
        }
    }
NXT:
    int d = 0;
    for (int i = 0; i < 14; i++) {
        if (T[c + i] == '1')
            d |= 1 << i;
    }
    return d;
}

Compilation message

grader_ali.cpp:10:8: warning: '{anonymous}::_randmem' defined but not used [-Wunused-variable]
   10 |   char _randmem[12379];
      |        ^~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 736 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 0 ms 656 KB Output is correct
4 Correct 1 ms 656 KB Output is correct
5 Correct 0 ms 656 KB Output is correct
6 Correct 19 ms 1216 KB Output is correct
7 Correct 26 ms 1136 KB Output is correct
8 Correct 25 ms 1176 KB Output is correct
9 Correct 23 ms 1184 KB Output is correct
10 Correct 22 ms 1452 KB Output is correct
11 Correct 7 ms 1140 KB Output is correct
12 Correct 11 ms 1184 KB Output is correct
13 Correct 9 ms 1132 KB Output is correct
14 Correct 9 ms 1176 KB Output is correct
15 Correct 8 ms 1784 KB Output is correct
16 Correct 10 ms 1256 KB Output is correct

Subtask #2
6.0 / 85.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 656 KB Output is correct
2 Partially correct 149 ms 1908 KB Output is partially correct
3 Correct 3 ms 656 KB Output is correct
4 Partially correct 1061 ms 1412 KB Output is partially correct
5 Partially correct 1061 ms 1440 KB Output is partially correct
6 Partially correct 1059 ms 1364 KB Output is partially correct
7 Partially correct 899 ms 1908 KB Output is partially correct
8 Partially correct 1156 ms 1332 KB Output is partially correct
9 Partially correct 414 ms 1648 KB Output is partially correct
10 Partially correct 427 ms 1912 KB Output is partially correct
11 Partially correct 743 ms 1360 KB Output is partially correct
12 Partially correct 28 ms 1132 KB Output is partially correct
13 Partially correct 238 ms 1420 KB Output is partially correct
14 Partially correct 363 ms 1244 KB Output is partially correct
15 Correct 5 ms 656 KB Output is correct
16 Partially correct 375 ms 1912 KB Output is partially correct
17 Partially correct 356 ms 1940 KB Output is partially correct
18 Partially correct 416 ms 1840 KB Output is partially correct
19 Partially correct 434 ms 1808 KB Output is partially correct
20 Partially correct 257 ms 1620 KB Output is partially correct
21 Partially correct 372 ms 1764 KB Output is partially correct
22 Partially correct 395 ms 1452 KB Output is partially correct
23 Partially correct 380 ms 1452 KB Output is partially correct
24 Partially correct 408 ms 1360 KB Output is partially correct
25 Partially correct 433 ms 1272 KB Output is partially correct
26 Partially correct 474 ms 1276 KB Output is partially correct
27 Partially correct 478 ms 1272 KB Output is partially correct
28 Partially correct 394 ms 1356 KB Output is partially correct
29 Partially correct 428 ms 1292 KB Output is partially correct
30 Partially correct 397 ms 1276 KB Output is partially correct
31 Partially correct 426 ms 1400 KB Output is partially correct
32 Partially correct 397 ms 1336 KB Output is partially correct
33 Partially correct 415 ms 1484 KB Output is partially correct
34 Partially correct 388 ms 1368 KB Output is partially correct
35 Partially correct 505 ms 1328 KB Output is partially correct
36 Partially correct 428 ms 1356 KB Output is partially correct
37 Partially correct 391 ms 1340 KB Output is partially correct
38 Partially correct 435 ms 1368 KB Output is partially correct
39 Partially correct 60 ms 1248 KB Output is partially correct
40 Partially correct 1112 ms 1884 KB Output is partially correct