oj.uz

Submission #115400

# Submission time Handle Problem Language Result Execution time Memory
115400 2019-06-07T07:14:26 Z dsjong Mechanical Doll (IOI18_doll) C++14
6 / 100
 94 ms 15140 KB 
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
bool vis[100005];
int cnt[100005];
vector<int>adj[100005];
void create_circuit(int M, vector<int> A){
	vector<int>C(M+1);
	memset(vis,false,sizeof vis);
	A.push_back(0);
	int S=0;
	C[0]=A[0];
	for(int i=0;i<A.size()-1;i++){
		cnt[A[i]]++;
		adj[A[i]].push_back(A[i+1]);
		if(cnt[A[i]]==2) S++;
	}
	vector<int>X(S),Y(S);
	int cur=-1;
	for(int i=0;i<A.size()-1;i++){
		if(vis[A[i]]){
			Y[-cur-1]=A[i+1];
			X[-cur-1]=adj[A[i]][0];
			C[A[i]]=cur--;
		}
		else C[A[i]]=A[i+1];
		vis[A[i]]=true;
	
	}
	for(int i=1;i<=M;i++){
		if(cnt[i]==0) C[i]=1;
	}
	/*cout<<C.size()<<endl;
	for(int i:C) cout<<i<<" ";
	cout<<endl;
	cout<<X.size()<<endl;
	for(int i:X) cout<<i<<" ";
	cout<<endl;
	cout<<Y.size()<<endl;
	for(int i:Y) cout<<i<<" ";
	cout<<endl;*/
	answer(C,X,Y);
}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:13:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |  for(int i=0;i<A.size()-1;i++){
      |              ~^~~~~~~~~~~
doll.cpp:20:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |  for(int i=0;i<A.size()-1;i++){
      |              ~^~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2636 KB Output is correct
2 Correct 36 ms 6884 KB Output is correct
3 Correct 38 ms 6344 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 19 ms 3916 KB Output is correct
6 Correct 49 ms 8272 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2636 KB Output is correct
2 Correct 36 ms 6884 KB Output is correct
3 Correct 38 ms 6344 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 19 ms 3916 KB Output is correct
6 Correct 49 ms 8272 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 77 ms 8728 KB Output is correct
9 Correct 64 ms 9268 KB Output is correct
10 Correct 94 ms 11996 KB Output is correct
11 Correct 4 ms 2636 KB Output is correct
12 Correct 3 ms 2636 KB Output is correct
13 Correct 3 ms 2636 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2636 KB Output is correct
2 Correct 36 ms 6884 KB Output is correct
3 Correct 38 ms 6344 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 19 ms 3916 KB Output is correct
6 Correct 49 ms 8272 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 77 ms 8728 KB Output is correct
9 Correct 64 ms 9268 KB Output is correct
10 Correct 94 ms 11996 KB Output is correct
11 Correct 4 ms 2636 KB Output is correct
12 Correct 3 ms 2636 KB Output is correct
13 Correct 3 ms 2636 KB Output is correct
14 Runtime error 83 ms 15140 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 5392 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 5324 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 5324 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -