oj.uz

답안 #829877

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
829877 2023-08-18T15:33:00 Z Essa2006 Data Transfer (IOI19_transfer) C++14
40 / 100
 234 ms 2544 KB 
#include "transfer.h"
#include<bits/stdc++.h>

using namespace std;

vector<int> get_attachment(vector<int> source) {
    vector<int>Ans;
	for(int j=0;j<=9;j++){
        int cur=(1<<j);
        int res=0;
        bool cont=0;
        for(int i=0;i<source.size();i++){
            if((i+1)&cur){
                cont=1;
                res^=source[i];
            }
        }
        if(!cont)
            continue;
        Ans.push_back(res);
	}
	int res=0;
	for(int i=0;i<Ans.size();i++){
        res^=Ans[i];
	}
	Ans.push_back(res);
	return Ans;
}

vector<int> retrieve(vector<int> data) {
	int ind=0;
	int n=15;
	if(data.size()>200){
        n=255;
	}
	vector<int>Cur(n);
	for(int j=0;j<=9;j++){
        int cur=(1<<j);
        int res=0;
        bool cont=0;
        for(int i=0;i<n;i++){
            if((i+1)&cur){
                cont=1;
                res^=data[i];
            }
        }
        if(!cont)
            continue;
        Cur.push_back(res);
	}
	int res=0;
	for(int i=n;i<data.size()-1;i++){
        res^=data[i];
        if(Cur[i]!=data[i]){
            ind+=(1<<(i-n));
        }
	}
	vector<int>Ans;
	for(int i=0;i<n;i++){
        Ans.push_back(data[i]);
	}
	if(ind && res!=data.back()){
        ind=0;
	}
	if(ind){
        Ans[ind-1]=!Ans[ind-1];
	}
	if(Ans.size()!=n)
        n/=0;
	return Ans;
}


//static inline string run_scenario() {
//	int c;
//	cin >> c;
//	if (c < -1)
//		return "invalid corruption index";
//	string source_str;
//	cin >> source_str;
//	const int N = source_str.size();
//	const int max_attachment_size = 2*N;
//	vector<int> source;
//	for (int i=0; i<N; i++)
//		source.push_back(source_str[i]-'0');
//
//	vector<int> attachment = get_attachment(source);
//	if (int(attachment.size()) > max_attachment_size)
//		return "attachment too large";
//	for (int x : attachment)
//		if (x != 0 && x != 1)
//			return "invalid attachment integer value";
//
//	vector<int> data(source);
//	data.insert(data.end(), attachment.begin(), attachment.end());
//
//	if (c >= int(data.size()))
//		return "invalid corruption index";
//
//	if (c >= 0)
//		data[c] = 1-data[c];
//
//	vector<int> result_source = retrieve(data);
//
//	if (source != result_source)
//		return "wrong source retrieval";
//
//	return string("OK K=")+to_string(attachment.size());
//}
//
//int main() {
//	int T;
//	cin >> T;
//	for (int scenario = 0; scenario < T; scenario++) {
//		string result = run_scenario();
//		cout << "scenario #" << scenario << ": " << result << endl;
//	}
//	return 0;
//}

Compilation message

transfer.cpp: In function 'std::vector<int> get_attachment(std::vector<int>)':
transfer.cpp:12:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |         for(int i=0;i<source.size();i++){
      |                     ~^~~~~~~~~~~~~~
transfer.cpp:23:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  for(int i=0;i<Ans.size();i++){
      |              ~^~~~~~~~~~~
transfer.cpp: In function 'std::vector<int> retrieve(std::vector<int>)':
transfer.cpp:52:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |  for(int i=n;i<data.size()-1;i++){
      |              ~^~~~~~~~~~~~~~
transfer.cpp:68:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   68 |  if(Ans.size()!=n)
      |     ~~~~~~~~~~^~~
transfer.cpp:69:10: warning: division by zero [-Wdiv-by-zero]
   69 |         n/=0;
      |         ~^~~

Subtask #1
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 904 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 195 ms 2484 KB Output is correct
2 Correct 232 ms 2456 KB Output is correct
3 Correct 189 ms 2496 KB Output is correct
4 Correct 192 ms 2500 KB Output is correct
5 Correct 191 ms 2476 KB Output is correct
6 Correct 188 ms 2488 KB Output is correct
7 Correct 189 ms 2492 KB Output is correct
8 Correct 203 ms 2496 KB Output is correct
9 Correct 200 ms 2408 KB Output is correct
10 Correct 234 ms 2492 KB Output is correct
11 Correct 190 ms 2544 KB Output is correct
12 Correct 190 ms 2488 KB Output is correct
13 Correct 197 ms 2496 KB Output is correct
14 Correct 203 ms 2496 KB Output is correct
15 Correct 192 ms 2488 KB Output is correct
16 Correct 191 ms 2444 KB Output is correct
17 Correct 220 ms 2496 KB Output is correct
18 Correct 195 ms 2448 KB Output is correct
19 Correct 190 ms 2496 KB Output is correct