oj.uz

Submission #823640

# Submission time Handle Problem Language Result Execution time Memory
823640 2023-08-12T23:25:02 Z Fischer Cutting a rectangle (LMIO18_staciakampis) C++14
45 / 100
 123 ms 163660 KB 
#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e5 + 10;
const int maxa = 5e6 + 1;
int a[maxn][2];
int d[2 * maxa];
int vis[maxn];
int vis1[maxa];
int n;
vector<int> valid;
vector<int> ba[maxa];
int T;

long long get(long long x) {
    if (vis1[x] == T) return 0;
    vis1[x] = T;
    long long sum = 0;
    for (int id : ba[x]) {
        if (vis[id] < T) {
            vis[id] = T;
            sum += a[id][0];
        }
    }
    return sum;
}

bool check(long long l, long long r) {
    for (int i=0; i<n; ++i) {
        if (vis[i] == T) continue;
        vis[i] = T;
        if (r < l) swap(l, r);
        if (l < 0) return 0; 
        if (a[i][0] == r) {
            l -= a[i][1];
        } else if (a[i][0] == l) {
            r -= a[i][1];
        } else if (a[i][1] == l) {
            r -= a[i][0];
        } else {
            if (l < a[i][1] || r < a[i][0]) return 0;
            long long el = l;
            long long er = r - a[i][0];    
            if (l >= maxa) return 0;
            long long len = get(l); 
            if (len > er) return 0;
            if (len < er) {
                int need_id = d[l];
                if (need_id == -1) return 0;
                if (a[need_id][1] != er - len) return 0;
                if (vis[need_id] == T) return 0; 
                vis[need_id] = T;
            }
            l -= a[i][1];
            r = a[i][0];
        }   
    }   
    if (r < 0 || l < 0) return 0;
    return l == 0 || r == 0;
}

const long long maxA = 5e13;
void solve(long long area) {
    if (area >= maxA) return;
    for (int i = 1; i*1ll*i <= area; ++i) {
        if (area % i) continue;
        if (i >= maxa) continue;
        T++;
        if (check(i, area / i)) {
            valid.push_back(i);
        }
    }   
}   

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cin>>n;
    long long area = 0;
    memset(d, -1, sizeof d);
    for (int i=0; i<n; ++i) {
        cin>>a[n-i-1][0]>>a[n-i-1][1];
    }  
    d[0] = n;
    for (int i=0; i<n; ++i) {
        d[a[i][0]] = i;
        ba[a[i][1]].push_back(i);
        area += a[i][0]*1ll*a[i][1];
    }
    solve(area);
    cout << valid.size() << '\n';
    for (auto e : valid) {
        cout << e << '\n';
    }
    return 0;
}

Compilation message

staciakampis.cpp: In function 'bool check(long long int, long long int)':
staciakampis.cpp:42:23: warning: unused variable 'el' [-Wunused-variable]
   42 |             long long el = l;
      |                       ^~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 156876 KB Output is correct
2 Correct 65 ms 156876 KB Output is correct
3 Correct 88 ms 156884 KB Output is correct
4 Correct 106 ms 157124 KB Output is correct
5 Correct 67 ms 156840 KB Output is correct
6 Correct 108 ms 156900 KB Output is correct
7 Correct 68 ms 156876 KB Output is correct
8 Correct 67 ms 156788 KB Output is correct
9 Correct 70 ms 156880 KB Output is correct
10 Correct 71 ms 156764 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 156788 KB Output is correct
2 Correct 70 ms 156880 KB Output is correct
3 Correct 71 ms 156764 KB Output is correct
4 Correct 78 ms 159476 KB Output is correct
5 Correct 82 ms 159536 KB Output is correct
6 Correct 82 ms 159580 KB Output is correct
7 Correct 81 ms 159576 KB Output is correct

Subtask #3
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 156876 KB Output is correct
2 Correct 65 ms 156876 KB Output is correct
3 Correct 88 ms 156884 KB Output is correct
4 Correct 106 ms 157124 KB Output is correct
5 Correct 67 ms 156840 KB Output is correct
6 Correct 108 ms 156900 KB Output is correct
7 Correct 68 ms 156876 KB Output is correct
8 Correct 67 ms 156788 KB Output is correct
9 Correct 70 ms 156880 KB Output is correct
10 Correct 71 ms 156764 KB Output is correct
11 Correct 78 ms 159476 KB Output is correct
12 Correct 82 ms 159536 KB Output is correct
13 Correct 82 ms 159580 KB Output is correct
14 Correct 81 ms 159576 KB Output is correct
15 Correct 122 ms 163660 KB Output is correct
16 Correct 109 ms 159964 KB Output is correct
17 Correct 123 ms 159980 KB Output is correct
18 Correct 78 ms 160400 KB Output is correct
19 Correct 100 ms 159852 KB Output is correct
20 Correct 121 ms 159980 KB Output is correct
21 Correct 69 ms 156876 KB Output is correct
22 Incorrect 83 ms 159808 KB Output isn't correct
23 Halted 0 ms 0 KB -