oj.uz

답안 #907344

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
907344 2024-01-15T11:54:58 Z lighton Minerals (JOI19_minerals) C++17
0 / 100
 1 ms 504 KB 
#include "minerals.h"
#include <bits/stdc++.h>
#define forf(i,a,b) for(int i = a; i<=b; i++)
using namespace std;
int N,M;
set<int> S;
vector<int> pre,sec;
vector<int> match;
int last;
void dnc(int s, int e , vector<int> v , int d){
    if(s==e){
        for(int i : v) match[i] = sec[s];
        return;
    }
    int m = s+e>>1;
    int now = 0;
    if(last > m) forf(i,m+1,last){ now = Query(sec[i]); }
    else forf(i,last+1,m){ now = Query(sec[i]); }

    vector<int> v1,v2;
    for(int i : v){
        int prv = now;
        if(v1.size() == (m-s+1)){ v2.push_back(i); continue; }
        if(v2.size() == (m-s+1)){ v1.push_back(i); continue; }
        now = Query(pre[i]);
        if(now == prv) v1.push_back(i);
        else v2.push_back(i);
    }
    last = m;
    dnc(m+1,e,v2,d+1);
    last = m;
    dnc(s,m,v1,d+1);
}

void Solve(int N) {
    int now = 0;
    forf(i,1,2*N){
        int prv = now;
        if(pre.size() == N){ sec.push_back(i); continue; }
        if(sec.size() == N){ pre.push_back(i); Query(i); continue; }
        now = Query(i);
        if(now == prv+1){
            pre.push_back(i);
        }
        else{
            sec.push_back(i);
        }
    }
    last = N-1;
    assert(pre.size() == N);
    match.resize(N);

    vector<int> v; forf(i,0,N-1) v.push_back(i);
    dnc(0,N-1,v,1);
    forf(i,0,N-1) Answer(pre[i],match[i]);
}

Compilation message

minerals.cpp: In function 'void dnc(int, int, std::vector<int>, int)':
minerals.cpp:15:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   15 |     int m = s+e>>1;
      |             ~^~
minerals.cpp:23:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   23 |         if(v1.size() == (m-s+1)){ v2.push_back(i); continue; }
      |            ~~~~~~~~~~^~~~~~~~~~
minerals.cpp:24:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |         if(v2.size() == (m-s+1)){ v1.push_back(i); continue; }
      |            ~~~~~~~~~~^~~~~~~~~~
minerals.cpp: In function 'void Solve(int)':
minerals.cpp:39:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |         if(pre.size() == N){ sec.push_back(i); continue; }
      |            ~~~~~~~~~~~^~~~
minerals.cpp:40:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   40 |         if(sec.size() == N){ pre.push_back(i); Query(i); continue; }
      |            ~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from minerals.cpp:2:
minerals.cpp:50:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |     assert(pre.size() == N);
      |            ~~~~~~~~~~~^~~~

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 504 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 504 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 504 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 504 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 504 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 504 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 504 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 504 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -