oj.uz

답안 #875921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
875921 2023-11-20T18:44:43 Z danikoynov Broken Device 2 (JOI22_device2) C++17
25 / 100
 64 ms 3804 KB 
#include "Anna.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int Declare()
{
    return 200;
}

std::pair<std::vector<int>, std::vector<int> > Anna(long long A)
{
    vector < int > lf;
    vector < int > rf;
    while(A > 0)
    {
        rf.push_back(A % 2);
        rf.push_back(A % 2);
        rf.push_back(A % 2);
        A /= 2;
    }
    for (int i = 0; i < rf.size(); i ++)
    {
        if (i % 2 == 0)
            lf.push_back(1);
        else
            lf.push_back(0);
    }
    /**cout << "up" << endl;
    for (int i = 0; i < lf.size(); i ++)
        cout << lf[i] << " ";
    cout << endl;
    cout << "down" << endl;
    for (int i = 0; i < rf.size(); i ++)
        cout << rf[i] << " ";
    cout << endl;*/
    return make_pair(lf, rf);
}

#include "Bruno.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;


long long Bruno(std::vector<int> u)
{

    ll ans = 0, last = 0, bit = 0;
    ll pref = 0;
    /**for (int cur : u)
        cout << cur << " ";
    cout << endl;*/
    for (int i = 0; i < u.size(); i ++)
    {

        int val = pref + u[i];
        pref += u[i];
        val = val - (i + 1 - val);
        int ost = val % 3;
        if (ost < 0)
            ost += 3;
        ///cout << pref << " : " << val << " " << val % 3 << endl;
        if (ost <= 1)
        {

            val -= ost;
            if (last == -1e9)
                last = val / 3;
            else
            if (val / 3 > last)
            {
                last = val / 3;
                ans = ans + (1 << bit);
                bit ++;
            }
            else
            if (val / 3 < last)
            {
                last = val / 3;
                bit ++;
            }
        }
    }
    //cout << endl;
    //cout << ans << endl;
    return ans;
}

Compilation message

Anna.cpp: In function 'std::pair<std::vector<int>, std::vector<int> > Anna(long long int)':
Anna.cpp:25:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for (int i = 0; i < rf.size(); i ++)
      |                     ~~^~~~~~~~~~~

Bruno.cpp: In function 'long long int Bruno(std::vector<int>)':
Bruno.cpp:18:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for (int i = 0; i < u.size(); i ++)
      |                     ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 792 KB Output is correct
2 Correct 16 ms 1248 KB Output is correct
3 Correct 18 ms 1340 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 792 KB Output is correct
2 Correct 16 ms 1248 KB Output is correct
3 Correct 18 ms 1340 KB Output is correct
4 Correct 27 ms 1872 KB Output is correct
5 Correct 27 ms 1836 KB Output is correct
6 Correct 31 ms 1940 KB Output is correct
7 Correct 40 ms 1732 KB Output is correct
8 Correct 27 ms 1828 KB Output is correct
9 Correct 27 ms 1832 KB Output is correct
10 Correct 26 ms 1816 KB Output is correct

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 792 KB Output is correct
2 Correct 16 ms 1248 KB Output is correct
3 Correct 18 ms 1340 KB Output is correct
4 Correct 27 ms 1872 KB Output is correct
5 Correct 27 ms 1836 KB Output is correct
6 Correct 31 ms 1940 KB Output is correct
7 Correct 40 ms 1732 KB Output is correct
8 Correct 27 ms 1828 KB Output is correct
9 Correct 27 ms 1832 KB Output is correct
10 Correct 26 ms 1816 KB Output is correct
11 Correct 28 ms 1916 KB Output is correct
12 Correct 28 ms 1780 KB Output is correct
13 Correct 40 ms 1668 KB Output is correct
14 Correct 30 ms 1932 KB Output is correct
15 Correct 35 ms 1748 KB Output is correct
16 Correct 30 ms 1944 KB Output is correct
17 Correct 28 ms 1952 KB Output is correct
18 Correct 26 ms 1856 KB Output is correct
19 Correct 28 ms 1784 KB Output is correct
20 Correct 27 ms 1764 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 792 KB Output is correct
2 Correct 16 ms 1248 KB Output is correct
3 Correct 18 ms 1340 KB Output is correct
4 Correct 27 ms 1872 KB Output is correct
5 Correct 27 ms 1836 KB Output is correct
6 Correct 31 ms 1940 KB Output is correct
7 Correct 40 ms 1732 KB Output is correct
8 Correct 27 ms 1828 KB Output is correct
9 Correct 27 ms 1832 KB Output is correct
10 Correct 26 ms 1816 KB Output is correct
11 Correct 28 ms 1916 KB Output is correct
12 Correct 28 ms 1780 KB Output is correct
13 Correct 40 ms 1668 KB Output is correct
14 Correct 30 ms 1932 KB Output is correct
15 Correct 35 ms 1748 KB Output is correct
16 Correct 30 ms 1944 KB Output is correct
17 Correct 28 ms 1952 KB Output is correct
18 Correct 26 ms 1856 KB Output is correct
19 Correct 28 ms 1784 KB Output is correct
20 Correct 27 ms 1764 KB Output is correct
21 Correct 33 ms 2052 KB Output is correct
22 Correct 33 ms 2180 KB Output is correct
23 Correct 35 ms 2212 KB Output is correct
24 Correct 37 ms 2052 KB Output is correct
25 Correct 38 ms 2104 KB Output is correct
26 Correct 34 ms 2068 KB Output is correct
27 Correct 36 ms 2152 KB Output is correct
28 Correct 30 ms 1924 KB Output is correct
29 Correct 32 ms 1832 KB Output is correct
30 Correct 28 ms 1960 KB Output is correct

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 792 KB Output is correct
2 Correct 16 ms 1248 KB Output is correct
3 Correct 18 ms 1340 KB Output is correct
4 Correct 27 ms 1872 KB Output is correct
5 Correct 27 ms 1836 KB Output is correct
6 Correct 31 ms 1940 KB Output is correct
7 Correct 40 ms 1732 KB Output is correct
8 Correct 27 ms 1828 KB Output is correct
9 Correct 27 ms 1832 KB Output is correct
10 Correct 26 ms 1816 KB Output is correct
11 Correct 28 ms 1916 KB Output is correct
12 Correct 28 ms 1780 KB Output is correct
13 Correct 40 ms 1668 KB Output is correct
14 Correct 30 ms 1932 KB Output is correct
15 Correct 35 ms 1748 KB Output is correct
16 Correct 30 ms 1944 KB Output is correct
17 Correct 28 ms 1952 KB Output is correct
18 Correct 26 ms 1856 KB Output is correct
19 Correct 28 ms 1784 KB Output is correct
20 Correct 27 ms 1764 KB Output is correct
21 Correct 33 ms 2052 KB Output is correct
22 Correct 33 ms 2180 KB Output is correct
23 Correct 35 ms 2212 KB Output is correct
24 Correct 37 ms 2052 KB Output is correct
25 Correct 38 ms 2104 KB Output is correct
26 Correct 34 ms 2068 KB Output is correct
27 Correct 36 ms 2152 KB Output is correct
28 Correct 30 ms 1924 KB Output is correct
29 Correct 32 ms 1832 KB Output is correct
30 Correct 28 ms 1960 KB Output is correct
31 Incorrect 59 ms 2544 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #6
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 64 ms 3804 KB Output isn't correct
2 Halted 0 ms 0 KB -