oj.uz

답안 #503166

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
503166 2022-01-07T12:07:06 Z leinad2 Minerals (JOI19_minerals) C++17
70 / 100
 57 ms 14148 KB 
#include "minerals.h"
#include<bits/stdc++.h>
using namespace std;
vector<int>A;
vector<vector<int> >v;
int a;
void solve()
{
    bool flag=true;
    for(int i=0;i<v.size();i++)if(v[i].size()>=2)flag=false;
    if(flag)return;
    int sz=0;
    for(int i=0;i<v.size();i++)
    {
        if(i%2==0)
        {
            for(int j=sz+(v[i].size()+1)/2;j<sz+v[i].size();j++)a=Query(A[j]);
        }
        else
        {
            for(int j=sz;j<sz+(v[i].size()+1)/2;j++)a=Query(A[j]);
        }
        sz+=v[i].size();
    }
    vector<vector<int> >V;
    for(int i=0;i<v.size();i++)
    {
        vector<int>Fi, Se;
        for(auto p:v[i])
        {
            int b=Query(p);
            if(a!=b)Se.push_back(p);
            else Fi.push_back(p);
            a=b;
        }
        V.push_back(Fi);
        V.push_back(Se);
    }
    v=V;
    solve();
}
void Solve(int N)
{
    vector<int>A, B;
    for(int i=1;i<=2*N;i++)
    {
        int b=Query(i);
        if(a!=b)A.push_back(i);
        else B.push_back(i);
        a=b;
    }
    ::A=A;
    v={B};
    solve();
    vector<int>ans;
    for(int i=0;i<v.size();i++)if(v[i].size())ans.push_back(v[i][0]);
    for(int i=0;i<N;i++)Answer(A[i], ans[i]);
}

Compilation message

minerals.cpp: In function 'void solve()':
minerals.cpp:10:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for(int i=0;i<v.size();i++)if(v[i].size()>=2)flag=false;
      |                 ~^~~~~~~~~
minerals.cpp:13:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
minerals.cpp:17:45: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |             for(int j=sz+(v[i].size()+1)/2;j<sz+v[i].size();j++)a=Query(A[j]);
      |                                            ~^~~~~~~~~~~~~~~
minerals.cpp:21:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |             for(int j=sz;j<sz+(v[i].size()+1)/2;j++)a=Query(A[j]);
      |                          ~^~~~~~~~~~~~~~~~~~~~~
minerals.cpp:26:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
minerals.cpp: In function 'void Solve(int)':
minerals.cpp:56:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for(int i=0;i<v.size();i++)if(v[i].size())ans.push_back(v[i][0]);
      |                 ~^~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 456 KB Output is correct
2 Correct 3 ms 840 KB Output is correct
3 Correct 4 ms 1352 KB Output is correct
4 Correct 7 ms 2376 KB Output is correct
5 Correct 16 ms 4388 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 3 ms 840 KB Output is correct
7 Correct 4 ms 1352 KB Output is correct
8 Correct 7 ms 2376 KB Output is correct
9 Correct 16 ms 4388 KB Output is correct
10 Correct 1 ms 584 KB Output is correct
11 Correct 11 ms 3804 KB Output is correct
12 Correct 16 ms 4500 KB Output is correct
13 Correct 12 ms 4496 KB Output is correct
14 Correct 16 ms 4452 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 3 ms 840 KB Output is correct
7 Correct 4 ms 1352 KB Output is correct
8 Correct 7 ms 2376 KB Output is correct
9 Correct 16 ms 4388 KB Output is correct
10 Correct 1 ms 584 KB Output is correct
11 Correct 11 ms 3804 KB Output is correct
12 Correct 16 ms 4500 KB Output is correct
13 Correct 12 ms 4496 KB Output is correct
14 Correct 16 ms 4452 KB Output is correct
15 Correct 46 ms 14148 KB Output is correct
16 Correct 57 ms 14132 KB Output is correct
17 Correct 41 ms 14088 KB Output is correct
18 Correct 40 ms 13912 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 3 ms 840 KB Output is correct
7 Correct 4 ms 1352 KB Output is correct
8 Correct 7 ms 2376 KB Output is correct
9 Correct 16 ms 4388 KB Output is correct
10 Correct 1 ms 584 KB Output is correct
11 Correct 11 ms 3804 KB Output is correct
12 Correct 16 ms 4500 KB Output is correct
13 Correct 12 ms 4496 KB Output is correct
14 Correct 16 ms 4452 KB Output is correct
15 Correct 46 ms 14148 KB Output is correct
16 Correct 57 ms 14132 KB Output is correct
17 Correct 41 ms 14088 KB Output is correct
18 Correct 40 ms 13912 KB Output is correct
19 Incorrect 37 ms 11172 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 3 ms 840 KB Output is correct
7 Correct 4 ms 1352 KB Output is correct
8 Correct 7 ms 2376 KB Output is correct
9 Correct 16 ms 4388 KB Output is correct
10 Correct 1 ms 584 KB Output is correct
11 Correct 11 ms 3804 KB Output is correct
12 Correct 16 ms 4500 KB Output is correct
13 Correct 12 ms 4496 KB Output is correct
14 Correct 16 ms 4452 KB Output is correct
15 Correct 46 ms 14148 KB Output is correct
16 Correct 57 ms 14132 KB Output is correct
17 Correct 41 ms 14088 KB Output is correct
18 Correct 40 ms 13912 KB Output is correct
19 Incorrect 37 ms 11172 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 3 ms 840 KB Output is correct
7 Correct 4 ms 1352 KB Output is correct
8 Correct 7 ms 2376 KB Output is correct
9 Correct 16 ms 4388 KB Output is correct
10 Correct 1 ms 584 KB Output is correct
11 Correct 11 ms 3804 KB Output is correct
12 Correct 16 ms 4500 KB Output is correct
13 Correct 12 ms 4496 KB Output is correct
14 Correct 16 ms 4452 KB Output is correct
15 Correct 46 ms 14148 KB Output is correct
16 Correct 57 ms 14132 KB Output is correct
17 Correct 41 ms 14088 KB Output is correct
18 Correct 40 ms 13912 KB Output is correct
19 Incorrect 37 ms 11172 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 3 ms 840 KB Output is correct
7 Correct 4 ms 1352 KB Output is correct
8 Correct 7 ms 2376 KB Output is correct
9 Correct 16 ms 4388 KB Output is correct
10 Correct 1 ms 584 KB Output is correct
11 Correct 11 ms 3804 KB Output is correct
12 Correct 16 ms 4500 KB Output is correct
13 Correct 12 ms 4496 KB Output is correct
14 Correct 16 ms 4452 KB Output is correct
15 Correct 46 ms 14148 KB Output is correct
16 Correct 57 ms 14132 KB Output is correct
17 Correct 41 ms 14088 KB Output is correct
18 Correct 40 ms 13912 KB Output is correct
19 Incorrect 37 ms 11172 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 3 ms 840 KB Output is correct
7 Correct 4 ms 1352 KB Output is correct
8 Correct 7 ms 2376 KB Output is correct
9 Correct 16 ms 4388 KB Output is correct
10 Correct 1 ms 584 KB Output is correct
11 Correct 11 ms 3804 KB Output is correct
12 Correct 16 ms 4500 KB Output is correct
13 Correct 12 ms 4496 KB Output is correct
14 Correct 16 ms 4452 KB Output is correct
15 Correct 46 ms 14148 KB Output is correct
16 Correct 57 ms 14132 KB Output is correct
17 Correct 41 ms 14088 KB Output is correct
18 Correct 40 ms 13912 KB Output is correct
19 Incorrect 37 ms 11172 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -