oj.uz

Submission #825602

# Submission time Handle Problem Language Result Execution time Memory
825602 2023-08-15T06:02:24 Z ZHIRDILBILDIZ Vision Program (IOI19_vision) C++14
12 / 100
 7 ms 1328 KB 
#include<bits/stdc++.h>
#include "vision.h"
#define fi first
#define se second
#define ll long long
using namespace std ;
void construct_network(int n, int m, int k)
{
    vector<int> all ;
    for(int i = 0 ; i < n * m ; i++)
        all.push_back(i) ;
    vector<int> arr_l, arr_l_k1, arr_l_k, arr_r, arr_r_k1, arr_r_k ;
    for(int i = n - 1 ; i >= 0 ; i--)
    {
        int x = i, y = 0 ;
        vector<int> now ;
        while(x < n && y < m)
        {
            now.push_back(x * m + y) ;
            x++ ;
            y++ ;
        }
        arr_l.push_back(add_or(now)) ;
    }
    for(int i = 1 ; i < m ; i++)
    {
        int x = 0, y = i ;
        vector<int> now ;
        while(x < n && y < m)
        {
            now.push_back(x * m + y) ;
            x++ ;
            y++ ;
        }
        arr_l.push_back(add_or(now)) ;
    }
    for(int i = k - 1 ; i < arr_l.size() ; i++)
    {
        vector<int> now ;
        for(int j = i - k + 1 ; j <= i ; j++)
            now.push_back(arr_l[j]) ;
        arr_l_k.push_back(add_xor({add_xor(now), add_or(now)})) ;
    }
    for(int i = k ; i < arr_l.size() ; i++)
    {
        vector<int> now ;
        for(int j = i - k ; j <= i ; j++)
            now.push_back(arr_l[j]) ;
        arr_l_k1.push_back(add_xor({add_xor(now), add_or(now)})) ;
    }
    for(int i = 0 ; i < m ; i++)
    {
        int x = 0, y = i ;
        vector<int> now ;
        while(x >= 0 && y >= 0)
        {
            now.push_back(x * m + y) ;
            x-- ;
            y-- ;
        }
        arr_r.push_back(add_or(now)) ;
    }
    for(int i = 1 ; i < n ; i++)
    {
        int x = i, y = m - 1 ;
        vector<int> now ;
        while(x >= 0 && y >= 0)
        {
            now.push_back(x * m + y) ;
            x-- ;
            y-- ;
        }
        arr_r.push_back(add_or(now)) ;
    }
    for(int i = k - 1 ; i < arr_r.size() ; i++)
    {
        vector<int> now ;
        for(int j = i - k + 1 ; j <= i ; j++)
            now.push_back(arr_r[j]) ;
        arr_r_k.push_back(add_xor({add_xor(now), add_or(now)})) ;
    }
    for(int i = k ; i < arr_r.size() ; i++)
    {
        vector<int> now ;
        for(int j = i - k ; j <= i ; j++)
            now.push_back(arr_r[j]) ;
        arr_r_k1.push_back(add_xor({add_xor(now), add_or(now)})) ;
    }
    int num1 = add_and({add_or(arr_r_k1), add_or(arr_l_k1)}), num2 = add_and({add_or(arr_r_k), add_or(arr_l_k)}) ;
    add_xor({num1, num2}) ;
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:37:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(int i = k - 1 ; i < arr_l.size() ; i++)
      |                         ~~^~~~~~~~~~~~~~
vision.cpp:44:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for(int i = k ; i < arr_l.size() ; i++)
      |                     ~~^~~~~~~~~~~~~~
vision.cpp:75:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for(int i = k - 1 ; i < arr_r.size() ; i++)
      |                         ~~^~~~~~~~~~~~~~
vision.cpp:82:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     for(int i = k ; i < arr_r.size() ; i++)
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB on inputs (0, 0), (1, 0), expected 1, but computed 0
6 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB on inputs (0, 0), (1, 0), expected 1, but computed 0
6 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB on inputs (0, 0), (1, 0), expected 1, but computed 0
6 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB on inputs (0, 0), (1, 0), expected 1, but computed 0
6 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 7 ms 980 KB Output is correct
3 Correct 7 ms 980 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 6 ms 980 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 6 ms 988 KB Output is correct
11 Correct 7 ms 980 KB Output is correct
12 Correct 7 ms 980 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 6 ms 988 KB Output is correct
17 Correct 7 ms 968 KB Output is correct
18 Correct 7 ms 980 KB Output is correct
19 Correct 5 ms 852 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB on inputs (0, 0), (1, 0), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 1328 KB on inputs (82, 107), (124, 150), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB on inputs (0, 0), (1, 0), expected 1, but computed 0
6 Halted 0 ms 0 KB -