oj.uz

Submission #91707

# Submission time Handle Problem Language Result Execution time Memory
91707 2018-12-29T11:29:41 Z Retro3014 Aliens (IOI07_aliens) C++17
60 / 100
 5 ms 380 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
using namespace std;
typedef long long ll;
int N;
struct P{
    ll x, y;
};
typedef long long ll;
struct P2{
    ll x, y;
};
P2 ans;
P st;
struct SQ{
    P lu, rd;
    P mid;
    void cmid(){
        mid.x=(lu.x+rd.x)/2;
        mid.y=(lu.y+rd.y)/2;
    }
};
vector<P> v(1);
string str;
set<pair<ll, ll>> s;
char c[100];

bool chk(ll x, ll y){
    if(x<1 || x>N || y<1 || y>N)    return true;
    return false;
}

bool examine(ll x, ll y){
    if(chk(x, y))   return false;
    printf("examine %lld %lld\n", x, y);
    fflush(stdout);
    scanf("%s", c);
    return (c[0]=='t');
}

bool examin(P a){
    return examine(a.x, a.y);
}

SQ now;
int main(){
    scanf("%d%lld%lld", &N, &st.x, &st.y);
    ll t=1;
    P a=st;
    while(1){
        if(examine(a.x, a.y+t*2)){
            t*=2;
        }else{
            if(t==1){
                if(examine(a.x, a.y+t))  a.y++;
                break;
            }else{
                a.y+=t;
                t=1;
            }
        }
    }
    now.lu.y = a.y;
    a=st;   t=1;
    while(1){
        if(examine(a.x, a.y-t*2)){
            t*=2;
        }else{
            if(t==1){
                if(examine(a.x, a.y-t)) a.y--;
                break;
            }else{
                a.y-=t; t=1;
            }
        }
    }
    now.rd.y = a.y;
    a=st; t=1;
    while(1){
        if(examine(a.x+t*2, a.y)){
            t*=2;
        }else{
            if(t==1){
                if(examine(a.x+t, a.y)) a.x++;
                break;
            }else{
                a.x+=t; t=1;
            }
        }
    }
    now.rd.x = a.x;
    a=st; t=1;
    while(1){
        if(examine(a.x-t*2, a.y)){
            t*=2;
        }else{
            if(t==1){
                if(examine(a.x-1, a.y)) a.x--;
                break;
            }else{
                a.x-=t;
                t=1;
            }
        }
    }
    now.lu.x = a.x;
    
    now.cmid();
    v[0]=now.mid;
    int i=0;
    ll M=now.rd.x-now.lu.x+1;
    ll dx[4]={M, M, -M, -M}, dy[4]={M, -M, M, -M};
    s.insert(make_pair(v[0].x, v[0].y));
    while(i<v.size()){
        ans.x+=v[i].x;  ans.y+=v[i].y;
        for(int j=0; j<4; j++){
            if(!chk(v[i].x+dx[j], v[i].y+dy[j]) && s.find(make_pair(v[i].x+dx[j], v[i].y+dy[j]))==s.end() && examine(v[i].x+dx[j], v[i].y+dy[j])){
                s.insert(make_pair(v[i].x+dx[j], v[i].y+dy[j]));
                v.push_back({v[i].x+dx[j], v[i].y+dy[j]});
            }
        }
        i++;
    }
    printf("solution %lld %lld", ans.x/13, ans.y/13);
    fflush(stdout);
}

Compilation message

aliens.cpp: In function 'int main()':
aliens.cpp:117:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(i<v.size()){
           ~^~~~~~~~~
aliens.cpp: In function 'bool examine(ll, ll)':
aliens.cpp:40:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", c);
     ~~~~~^~~~~~~~~
aliens.cpp: In function 'int main()':
aliens.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%lld%lld", &N, &st.x, &st.y);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 4 ms 248 KB too many queries

Subtask #7
10.0 / 10.0

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

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Incorrect 4 ms 380 KB too many queries

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 376 KB too many queries
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Incorrect 5 ms 248 KB too many queries
3 Halted 0 ms 0 KB -