oj.uz

Submission #121249

# Submission time Handle Problem Language Result Execution time Memory
121249 2019-06-26T09:08:49 Z win11905 Flood (IOI07_flood) C++11
0 / 100
 1072 ms 30016 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
#define x first
#define y second
using namespace std;

const int N = 2e5+5;

int n, m;
int x[N], y[N];
int s[N], t[N];
int za[N], zb[N];
bool state[N][4];
int idx;
map<pii, int> Mp;

int par[N<<1];

int find(int u) { return par[u] = par[u] == u ? u : find(par[u]); }

void merge(int a, int b, int c, int d) {
    int u = Mp[pii(a, b)], v = Mp[pii(c, d)];
    par[find(u)] = find(v);
}

int main() {
    iota(par, par+(N<<1), 0);
    scanf("%d", &n);
    int mnx = 1e9, st;
    for(int i = 0; i < n; ++i) {
        scanf("%d %d", x+i, y+i);
        Mp[pii(x[i], y[i])] = ++idx;
        Mp[pii(x[i]+1, y[i])] = ++idx;
        Mp[pii(x[i], y[i]+1)] = ++idx;
        Mp[pii(x[i]+1, y[i]+1)] = ++idx;
        if(x[i] < mnx) mnx = x[i], st = i;
    }
    scanf("%d", &m);
    for(int i = 0; i < m; ++i) {
        scanf("%d %d", s+i, t+i), s[i]--, t[i]--;
        if(x[s[i]] > x[t[i]]) swap(s[i], t[i]);
        if(y[s[i]] > y[t[i]]) swap(s[i], t[i]);
        if(x[s[i]] != x[t[i]]) {
            state[s[i]][1] = state[t[i]][3] = true;
            merge(x[s[i]]+1, y[s[i]], x[t[i]], y[t[i]]);
            merge(x[s[i]]+1, y[s[i]]+1, x[t[i]], y[t[i]]+1);            
        } else {
            state[s[i]][0] = state[t[i]][2] = true;
            merge(x[s[i]], y[s[i]]+1, x[t[i]], y[t[i]]);
            merge(x[s[i]]+1, y[s[i]]+1, x[t[i]]+1, y[t[i]]);
        }
    }
    for(int i = 0; i < n; ++i) {
        if(!state[i][0]) merge(x[i], y[i]+1, x[i]+1, y[i]+1);
        if(!state[i][1]) merge(x[i]+1, y[i], x[i]+1, y[i]+1);
        if(!state[i][2]) merge(x[i], y[i], x[i]+1, y[i]);
        if(!state[i][3]) merge(x[i], y[i], x[i], y[i]+1);
    }
    for(int i = 0; i < m; ++i) {
        int a, b;
        if(x[s[i]] != x[t[i]]) 
            a = find(Mp[pii(x[s[i]]+1, y[s[i]])]), b = find(Mp[pii(x[s[i]]+1, y[s[i]]+1)]);
        else 
            a = find(Mp[pii(x[s[i]], y[s[i]]+1)]), b = find(Mp[pii(x[s[i]]+1, y[s[i]]+1)]);
        za[i] = a, zb[i] = b;
    }
    int start = find(Mp[pii(x[st], y[st])]);
    Mp.clear();
    
}

Compilation message

flood.cpp: In function 'int main()':
flood.cpp:67:9: warning: unused variable 'start' [-Wunused-variable]
     int start = find(Mp[pii(x[st], y[st])]);
         ^~~~~
flood.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
flood.cpp:31:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", x+i, y+i);
         ~~~~~^~~~~~~~~~~~~~~~~~~
flood.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &m);
     ~~~~~^~~~~~~~~~
flood.cpp:40:41: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", s+i, t+i), s[i]--, t[i]--;
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1920 KB Unexpected end of file - int32 expected

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1920 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1920 KB Unexpected end of file - int32 expected

Subtask #4
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1920 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1892 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #6
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1920 KB Unexpected end of file - int32 expected

Subtask #7
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2176 KB Unexpected end of file - int32 expected

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2048 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #9
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2048 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 81 ms 8668 KB Unexpected end of file - int32 expected

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 246 ms 19796 KB Unexpected end of file - int32 expected

Subtask #12
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 297 ms 26972 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #13
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 988 ms 29748 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #14
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1072 ms 30016 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -