oj.uz

답안 #1031599

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1031599 2024-07-23T02:25:16 Z Marco_Escandon Vision Program (IOI19_vision) C++17
26 / 100
 10 ms 2264 KB 
#include<bits/stdc++.h>
#include "vision.h"
using namespace std;
typedef int ll;
ll sol(ll k, vector<ll> a, vector<ll> b)
{
	vector<ll> temp1, temp2;
	for(int i=0; i<=a.size()-k; i++)
	{
		vector<ll> sub_vectora(a.begin() + i, a.begin() + i+k);
		vector<ll> sub_vectorb(b.begin() + i, b.begin() + i+k);
		temp1.push_back(add_and({add_not(add_xor(sub_vectora)),add_or(sub_vectora)}));
		temp2.push_back(add_and({add_not(add_xor(sub_vectorb)),add_or(sub_vectorb)}));
	}
	return add_and({add_or(temp1),add_or(temp2)});
}
void construct_network(int H, int W, int K) {
	vector<vector<ll>> ia(H+W-1), da(H+W-1);
	vector<ll>iaor,daor;
	for(int i=0; i<H; i++){
        for(int j=0; j<W; j++){
            ia[i+j].push_back(i*W+j);
            da[i-j+W-1].push_back(i*W+j);
        }
    }
	for(auto i:ia) if(i.size()>0) iaor.push_back(add_or(i));
	for(auto i:da) if(i.size()>0) daor.push_back(add_or(i));
	ll ans=add_and({sol(K+1,iaor,daor),add_not(sol(K,iaor,daor))});
}

Compilation message

vision.cpp: In function 'll sol(ll, std::vector<int>, std::vector<int>)':
vision.cpp:9:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |  for(int i=0; i<=a.size()-k; i++)
      |               ~^~~~~~~~~~~~
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:29:5: warning: unused variable 'ans' [-Wunused-variable]
   29 |  ll ans=add_and({sol(K+1,iaor,daor),add_not(sol(K,iaor,daor))});
      |     ^~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Incorrect 0 ms 348 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Incorrect 0 ms 348 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Incorrect 0 ms 348 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Incorrect 0 ms 348 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 5 ms 1116 KB Output is correct
3 Correct 7 ms 1116 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 728 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 4 ms 1368 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 4 ms 1116 KB Output is correct
11 Correct 5 ms 1116 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 4 ms 856 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 4 ms 1116 KB Output is correct
17 Correct 5 ms 1116 KB Output is correct
18 Correct 7 ms 1116 KB Output is correct
19 Correct 6 ms 860 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB on inputs (0, 0), (1, 1), expected 1, but computed 0
3 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2264 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 752 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 4 ms 1240 KB Output is correct
8 Correct 4 ms 1236 KB Output is correct
9 Correct 10 ms 2264 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Incorrect 0 ms 348 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -