oj.uz

Submission #121557

# Submission time Handle Problem Language Result Execution time Memory
121557 2019-06-26T18:50:06 Z DodgeBallMan Flood (IOI07_flood) C++14
100 / 100
 169 ms 11232 KB 
#include <bits/stdc++.h>
#define ppi pair<pair<int, int>, int>
#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 1e5 + 10;
pii p[N];
vector<ppi> v;
vector<int> ans;
int n, w, f[2*N], t[2*N], chk[2*N][2], di[2*N][4], visit[2*N];
priority_queue<ppi> pq;
int main()
{
    scanf("%d",&n);
    for( int i = 1 ; i <= n ; i++ ) scanf("%d %d",&p[i].x,&p[i].y);
    scanf("%d",&w);
    for( int i = 1 ; i <= w ; i++ ) {
        scanf("%d %d",&f[i],&t[i]);
        if( p[f[i]].x > p[t[i]].x || p[f[i]].y > p[t[i]].y ) swap( f[i], t[i] );
		if( p[f[i]].x == p[t[i]].x ) di[f[i]][3] = i, di[t[i]][1] = i;
		else di[f[i]][0] = i, di[t[i]][2] = i;
        pq.emplace( ppi( pii( p[t[i]].x, -1*p[t[i]].y ), i ) );
    }
    while( !pq.empty() ) {
        int wall = pq.top().y; pq.pop();
        if( visit[wall] ) continue;
        int now = f[wall], ty = p[f[wall]].y == p[t[wall]].y ? 2 : 1;
        vector<int> outside;
        while( 1 ) {
            int dir, to;
            for( int j = 0 ; j < 4 ; j++ ) {
                dir = ( ty + j + 3 ) % 4;
                to = di[now][dir];
                if( to > 0 && !visit[to] ) break; 
            }
            if( chk[to][dir/2] ) break;
            chk[to][dir/2] = 1;
            outside.emplace_back( to );
            ty = dir;
            if( now == f[to] ) now = t[to];
            else now = f[to];
        }
        for( int j = 0 ; j < outside.size() ; j++ ) visit[outside[j]] = 1;
    }
    for( int i = 1 ; i <= w ; i++ ) if( chk[i][0] > 0 && chk[i][1] > 0 ) ans.emplace_back( i );
    printf("%d\n",ans.size());
    for( int i = 0 ; i < ans.size() ; i++ ) printf("%d\n",ans[i]);
    return 0;
}

Compilation message

flood.cpp: In function 'int main()':
flood.cpp:46:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for( int j = 0 ; j < outside.size() ; j++ ) visit[outside[j]] = 1;
                          ~~^~~~~~~~~~~~~~~~
flood.cpp:49:29: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n",ans.size());
                   ~~~~~~~~~~^
flood.cpp:50:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for( int i = 0 ; i < ans.size() ; i++ ) printf("%d\n",ans[i]);
                      ~~^~~~~~~~~~~~
flood.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
flood.cpp:18:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for( int i = 1 ; i <= n ; i++ ) scanf("%d %d",&p[i].x,&p[i].y);
                                     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
flood.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&w);
     ~~~~~^~~~~~~~~
flood.cpp:21:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&f[i],&t[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
3.0 / 3.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
3.0 / 3.0

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

Subtask #7
3.0 / 3.0

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

Subtask #8
3.0 / 3.0

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

Subtask #9
3.0 / 3.0

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

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1788 KB Output is correct

Subtask #11
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 5484 KB Output is correct

Subtask #12
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 5484 KB Output is correct
2 Correct 135 ms 8360 KB Output is correct

Subtask #13
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 7516 KB Output is correct
2 Correct 169 ms 11232 KB Output is correct

Subtask #14
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 8292 KB Output is correct
2 Correct 104 ms 10232 KB Output is correct