oj.uz

Submission #1033764

# Submission time Handle Problem Language Result Execution time Memory
1033764 2024-07-25T05:11:47 Z 김은성(#10970) Tiles (BOI24_tiles) C++17
0 / 100
 32 ms 11612 KB 
#define x first
#define y second
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[1009][1009];
bool impos[1009];
ll ccw(pair<ll, ll> p, pair<ll, ll> q, pair<ll, ll> r){
    return (q.x-p.x)*(r.y-p.y) + (r.x-p.x)*(q.y-p.y);
}
int main(){
    int n, xm, ym = 1000, i, j;
    scanf("%d %d", &n, &xm);
    vector<pair<int, int> > p(n);
    for(i=0; i<n; i++)
        scanf("%d %d", &p[i].x, &p[i].y);
    for(i=0; i<n; i++){
        if(ccw(p[i], p[(i+1)%n], p[(i+2)%n]) < 0){
            for(i=0; i<n/2; i++)
                swap(p[i], p[n-1-i]);
            break;
        }
    }
    for(i=0; i<n; i++){
        int x1 = p[i].first, y1 = p[i].second;
        int x2 = p[(i+1)%n].first, y2 = p[(i+1)%n].second;
        if(y1 == y2){
            if(x1 < x2){
                for(j=x1; j<x2; j++)
                    a[j][y1]--;
            }
            else{
                for(j=x1-1; j>=x2; j--)
                    a[j][y2]++;
            }
        }
    }
    for(i=0; i<=xm; i++){
        for(j=0; j<=ym; j++){
            a[i][j] += (j==0 ? 0 : a[i][j-1]);
            //printf("%d", a[i][j]);
        }
        //printf("\n");
    }
    bool flag = 0;
    for(i=0; i<=xm; i++){
        int cur = 0;
        for(j=0; j<=ym; j++){
            if(!a[i][j]){
                if(cur%2 == 1){
                    flag = 1;
                    break;
                }
                cur = 0;
            }
            else
                cur++;
        }
        if(flag)
            impos[i] = 1;
    }
    for(i=0; i<=ym; i++){
        int cur = 0;
        bool flag = 0;
        for(j=0; j<=xm; j++){
            if(!a[j][i]){
                if(cur%2==1)
                    flag = 1;
                cur = 0;
            }
            else
                cur++;
            if(flag || cur%2)
                impos[j] = 1;
        }
    }
    int opt = 0;
    for(i=0; i<xm; i++){
        if(!impos[i])
            opt = i+1;
    }
    printf("%d\n", opt);
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     scanf("%d %d", &n, &xm);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
Main.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         scanf("%d %d", &p[i].x, &p[i].y);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 1 ms 348 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 1 ms 348 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4188 KB Output is correct
2 Runtime error 9 ms 9052 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 4188 KB Output is correct
5 Correct 21 ms 5720 KB Output is correct
6 Correct 22 ms 5604 KB Output is correct
7 Correct 4 ms 4184 KB Output is correct
8 Correct 4 ms 3932 KB Output is correct
9 Correct 6 ms 4188 KB Output is correct
10 Correct 4 ms 4352 KB Output is correct
11 Correct 4 ms 4188 KB Output is correct
12 Correct 4 ms 4188 KB Output is correct
13 Correct 4 ms 4332 KB Output is correct
14 Correct 4 ms 4188 KB Output is correct
15 Correct 4 ms 4188 KB Output is correct
16 Correct 5 ms 4188 KB Output is correct
17 Correct 23 ms 5864 KB Output is correct
18 Correct 22 ms 5724 KB Output is correct
19 Correct 5 ms 4444 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 2 ms 2300 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 4 ms 4380 KB Output is correct
25 Correct 3 ms 3676 KB Output is correct
26 Correct 1 ms 1628 KB Output is correct
27 Correct 3 ms 3932 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 2 ms 1880 KB Output is correct
31 Correct 2 ms 1880 KB Output is correct
32 Correct 3 ms 3312 KB Output is correct
33 Correct 4 ms 4184 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 3 ms 3164 KB Output is correct
37 Correct 3 ms 3420 KB Output is correct
38 Correct 5 ms 4184 KB Output is correct
39 Correct 2 ms 2652 KB Output is correct
40 Correct 4 ms 4188 KB Output is correct
41 Correct 3 ms 3932 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 3 ms 3420 KB Output is correct
47 Correct 1 ms 1624 KB Output is correct
48 Correct 4 ms 4188 KB Output is correct
49 Correct 22 ms 5860 KB Output is correct
50 Correct 22 ms 5792 KB Output is correct
51 Correct 22 ms 5468 KB Output is correct
52 Correct 22 ms 5724 KB Output is correct
53 Correct 3 ms 3676 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 5 ms 4440 KB Output is correct
56 Correct 5 ms 4184 KB Output is correct
57 Correct 4 ms 2252 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 3 ms 2908 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 5 ms 4184 KB Output is correct
64 Correct 5 ms 4188 KB Output is correct
65 Correct 3 ms 3420 KB Output is correct
66 Correct 4 ms 4188 KB Output is correct
67 Correct 4 ms 4440 KB Output is correct
68 Incorrect 4 ms 4188 KB Output isn't correct
69 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 32 ms 11612 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 1 ms 348 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -