oj.uz

Submission #576125

# Submission time Handle Problem Language Result Execution time Memory
576125 2022-06-12T11:18:40 Z urd05 Park (JOI17_park) C++17
20 / 100
 197 ms 472 KB 
#include "park.h"
#include <bits/stdc++.h>
using namespace std;

int place[1400];
int n;

bool comp(int a,int b) {
    for(int i=0;i<n;i++) {
        if (i==a) {
            place[i]=0;
        }
        else {
            place[i]=1;
        }
    }
    if (Ask(0,b,place)==0) {
        return true;
    }
    else {
        return false;
    }
}

void Detect(int t,int nn) {
    n=nn;
    if (t==1) {
        for(int i=0;i<n;i++) {
            for(int j=i+1;j<n;j++) {
                for(int k=0;k<n;k++) {
                    if (k==i||k==j) {
                        place[k]=1;
                    }
                    else {
                        place[k]=0;
                    }
                }
                if (Ask(i,j,place)==1) {
                    Answer(i,j);
                }
            }
        }
    }
    if (t==2) {
        vector<int> vec;
        for(int i=1;i<n-1;i++) {
            vec.push_back(i);
        }
        sort(vec.begin(),vec.end(),comp);
        Answer(0,vec[0]);
        Answer(vec[vec.size()-1],n-1);
        for(int i=1;i<vec.size();i++) {
            int one=vec[i-1];
            int two=vec[i];
            Answer(min(one,two),max(one,two));
        }
    }
}

Compilation message

park.cpp: In function 'void Detect(int, int)':
park.cpp:52:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |         for(int i=1;i<vec.size();i++) {
      |                     ~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 11 ms 212 KB Output is correct
3 Correct 12 ms 328 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 12 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 468 KB Output is correct
2 Correct 103 ms 464 KB Output is correct
3 Correct 111 ms 468 KB Output is correct
4 Correct 196 ms 472 KB Output is correct
5 Correct 197 ms 472 KB Output is correct

Subtask #3
0 / 27.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 23.0

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