oj.uz

Submission #823771

# Submission time Handle Problem Language Result Execution time Memory
823771 2023-08-13T06:16:22 Z ZHIRDILBILDIZ Vision Program (IOI19_vision) C++14
0 / 100
 2 ms 976 KB 
#include<bits/stdc++.h>
#include "vision.h"
#define fi first
#define se second
#define ll long long
using namespace std ;
const int N = 200, M = 200 ;
bool a[N][M] ;
//int add_not(int n)
//{
//}
//int add_and(int n, int m, vector<int> v)
//{
//    cout << "and\n" ;
//    int ind = v[0], ans = a[ind / m][ind % m] ;
//    for(int i : v)
//    {
//        cout << i << ' ' ;
//        int x = i / m, y = i % m ;
//        ans &= a[x][y] ;
//    }
//    cout << ans << '\n' ;
//    return ans ;
//}
//int add_or(vector<int> v)
//{
//}
//int add_xor(int n, int m, vector<int> v)
//{
//    cout << "xor\n" ;
//    int ans = 0 ;
//    for(int i : v)
//    {
//        cout << i << ' ' ;
//        int x = i / m, y = i % m ;
//        ans ^= a[x][y] ;
//    }
//    cout << ans ;
//    cout << '\n' ;
//    return ans ;
//}
void construct_network(int n, int m, int k)
{
    for(int x1 = 0 ; x1 < n ; x1++)
        for(int y1 = 0 ; y1 < m ; y1++)
            for(int x2 = x1 ; x2 < n ; x2++)
                for(int y2 = y1 ; y2 < m ; y2++)
                {
                    if(abs(x1 - x2) + abs(y2 - y1) == 0)
                        continue ;
                    vector<int> v ;
                    v.push_back(x1 * m + y1) ;
                    v.push_back(x2 * m + y2) ;
                    if(add_and(v) == 1 && add_xor(v) == 0)
                    {
                        if(abs(x1 - x2) + abs(y2 - y1) == k)
                            add_and(v) ;
                        else
                            add_xor(v) ;
                        return ;
                    }
                }
}
//signed main()
//{
//    int n, m, k ;
//    cin >> n >> m >> k ;
//    for(int i = 0 ; i < n ; i++)
//        for(int j = 0 ; j < n ; j++)
//            cin >> a[i][j] ;
//    construct_network(n, m, k) ;
//    return 0 ;
//}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 976 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

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

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 976 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

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