oj.uz

Submission #1072887

# Submission time Handle Problem Language Result Execution time Memory
1072887 2024-08-24T06:30:26 Z HappyCapybara Minerals (JOI19_minerals) C++17
0 / 100
 1 ms 344 KB 
#include "minerals.h"
#include<bits/stdc++.h>
using namespace std;

void Solve(int N){
  vector<bool> done(2*N);
  int cur = 0, m = 0;
  while (cur < 2*N){
    int x = Query(cur+1);
    if (x == m+1){
      m = x;
      cur++;
      continue;
    }
    for (int i=0; i<cur; i++){
      if (done[i]) continue;
      if (i == cur-1){
        Answer(i+1, cur+1);
        done[i] = true;
        done[cur] = true;
        break;
      }
      int y = Query(i+1);
      if (y == m){
        //cout << y+1 << " " << cur+1 << "\n";
        Answer(i+1, cur+1);
        done[i] = true;
        done[cur] = true;
        break;
      }
      m = y;
    }
    cur++;
  }
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -