oj.uz

답안 #251049

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
251049 2020-07-20T02:06:51 Z IsaacMoris Minerals (JOI19_minerals) C++14
0 / 100
 1 ms 512 KB 
#include<iostream>
#include <bits/stdc++.h>
#include "minerals.h"
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
void solve(vector<int> & v1, vector<int> & v2, bool p)
{
    int n=v1.size();
    if(n==1)
    {
        Answer(v1.back(),v2.back());
        return ;
    }
    if(!n)
        return;
    vector<int> x1, y1, x2, y2;
    int x;
    for(int i=1; i<=n; i++)
    {
        if(i<=max(n/3,1))
        {
            x=Query(v1[i-1]);
            x1.push_back(v1[i-1]);
        }
        else
            x2.push_back(v1[i-1]);
    }
    while(!v2.empty())
    {
        int i=v2.back();
        v2.pop_back();
        if(v2.empty())
        {
            if((int)x1.size()==(int)y1.size())
                y2.push_back(i);
            else
                v1.push_back(i);
            continue;
        }
        int q=Query(i);
        if((q!=x && p) || (q==x && !p))
            y1.push_back(i);
        else
            y2.push_back(i);
        x=q;
    }
    v1.clear(), v2.clear();
    solve(x1,y1,!p);
    solve(x2,y2,p);
}
void Solve(int N)
{
    vector<int> v1, v2;
    int last=0;
    for (int i = 1; i <= 2 * N; ++i)
    {
        int x=Query(i);
        if(x!=last)
            v1.push_back(i);
        else
            v2.push_back(i);
        last=x;
    }
    solve(v1,v2, 1);
}
/*int dp[42009];
int solve(int n)
{
    if(n<=1)
        return 0 ;
    int &ans=dp[n];
    if(ans!=-1)
        return ans;
    ans=1e9;
    int n1=max(n/3,1);
    ans=min(ans,n+n1-1+solve(n1)+solve(n-n1));
    return ans;
}
int main()
{
    memset(dp,-1,sizeof dp);
    cout<<solve(42000)+42000*2;
}
*/

Compilation message

minerals.cpp: In function 'void solve(std::vector<int>&, std::vector<int>&, bool)':
minerals.cpp:43:14: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if((q!=x && p) || (q==x && !p))
             ~^~~

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -