oj.uz

Submission #288219

# Submission time Handle Problem Language Result Execution time Memory
288219 2020-09-01T10:18:32 Z Kastanda Aliens (IOI07_aliens) C++11
60 / 100
 2 ms 256 KB 
// M
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m, nwx, nwy;
int main()
{
        scanf("%lld%lld%lld", &n, &nwx, &nwy);

        auto Query = [&](ll a, ll b){
                if (a < 1 || a > n || b < 1 || b > n)
                        return false;
                printf("examine %lld %lld\n", a, b);
                fflush(stdout);
                char ss[7];
                scanf("%s", ss);
                return (bool)(ss[0] == 't');
        };

        {
                ll lg = 0;
                while (Query(nwx - (1LL << lg), nwy))
                        lg ++;
                ll left_gap = 0;
                for (int i = lg - 1; i >= 0; i --)
                        if (Query(nwx - left_gap - (1LL << i), nwy))
                                left_gap |= 1LL << i;

                lg = 0;
                while (Query(nwx + (1LL << lg), nwy))
                        lg ++;
                ll right_gap = 0;
                for (int i = lg - 1; i >= 0; i --)
                        if (Query(nwx + right_gap + (1LL << i), nwy))
                                right_gap |= 1LL << i;

                m = right_gap + left_gap + 1;
                nwx -= left_gap;

                lg = 0;
                while (Query(nwx, nwy - (1LL << lg)))
                        lg ++;
                ll up_gap = 0;
                for (int i = lg - 1; i >= 0; i --)
                        if (Query(nwx, nwy - up_gap - (1LL << i)))
                                up_gap |= 1LL << i;

                nwy -= up_gap;

                ll cx = 0, cy = 0;
                while (Query(nwx - m * (cx + 2), nwy))
                        cx += 2;
                if (Query(nwx - m * cx - m, nwy - m))
                        cx ++, cy ++;

                while (Query(nwx, nwy - m * (cy + 2)))
                        cy += 2;

                nwx -= m * cx;
                nwy -= m * cy;

                nwx += m * 2 + m / 2;
                nwy += m * 2 + m / 2;
                printf("solution %lld %lld\n", nwx, nwy);
        }
}

Compilation message

aliens.cpp: In function 'int main()':
aliens.cpp:8:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    8 |         scanf("%lld%lld%lld", &n, &nwx, &nwy);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
aliens.cpp: In lambda function:
aliens.cpp:16:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |                 scanf("%s", ss);
      |                 ~~~~~^~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 0 ms 256 KB Incorrect

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 256 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Incorrect 1 ms 256 KB Incorrect