oj.uz

Submission #1109171

# Submission time Handle Problem Language Result Execution time Memory
1109171 2024-11-06T06:50:02 Z KasymK Mosaic (IOI24_mosaic) C++17
22 / 100
 768 ms 89752 KB 
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 4e5+5;
int cnt[N];

int wow(int a, int b){
    return (!(a|b)?1:0);
}

vector<ll> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R){
    map<pii, int> mp;
    int n = (int)X.size();
    for(int i = 1; i <= n; ++i)
        mp[{1, i}] = X[i-1], mp[{i, 1}] = Y[i-1];
    for(int i = 2; i <= n; ++i)
        for(int j = 2; j <= 3; ++j)
            mp[{i, j}] = wow(mp[{i-1, j}], mp[{i, j-1}]);
    for(int i = 2; i <= 3; ++i)
        for(int j = 2; j <= n; ++j)
            mp[{i, j}] = wow(mp[{i-1, j}], mp[{i, j-1}]);
    int i = 3, j;
    for(j = 3; j <= n; ++j)
        cnt[i-j+n] = mp[{i, j}];
    j = 3;
    for(i = 3; i <= n; ++i)
        cnt[i-j+n] = mp[{i, j}];
    int q = (int)L.size();
    vector<ll> ans;
    for(int ad = 0; ad < q; ++ad){
        int x = T[ad]+1, y = L[ad]+1;
        if(x <= 3 or y <= 3)
            ans.pb(mp[{x, y}]);
        else
            ans.pb(cnt[x-y+n]);
    }
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Incorrect 1 ms 336 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Incorrect 1 ms 336 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 768 ms 89680 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Incorrect 1 ms 336 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 54 ms 9892 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 658 ms 89684 KB Output is correct
2 Correct 670 ms 89752 KB Output is correct
3 Correct 681 ms 89532 KB Output is correct
4 Correct 686 ms 89612 KB Output is correct
5 Correct 695 ms 89532 KB Output is correct
6 Correct 328 ms 49596 KB Output is correct
7 Correct 213 ms 32500 KB Output is correct

Subtask #7
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 768 ms 89680 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -