QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#94879#5671. Programmable Viruspedroteosousa#AC ✓2ms3616kbC++144.4kb2023-04-08 03:17:272023-04-08 03:17:31

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-04-08 03:17:31]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:3616kb
  • [2023-04-08 03:17:27]
  • 提交

answer

#include <bits/stdc++.h>
#define mod 1'000'000'007
#define ll long long
#define debug 
using namespace std;

int level = 0;

void stop(){
	for(int i=0;i<2*level;i++) debug(stderr," ");
	printf("CCC");
	debug(stderr,"stop\n");
}

void next(){
	for(int i=0;i<2*level;i++)debug(stderr," ");
	printf("ACG");
	debug(stderr,"next\n");
}

void prev(){
	for(int i=0;i<2*level;i++) debug(stderr," ");
	printf("UGA");
	debug(stderr,"prev\n");
}

void inc(){
	for(int i=0;i<2*level;i++)debug(stderr," ");
	printf("UGC");
	debug(stderr,"inc\n");
}

void dec(){
	for(int i=0;i<2*level;i++) debug(stderr," ");
	printf("UAC");
	debug(stderr,"dec\n");
}

void out(){
	for(int i=0;i<2*level;i++) debug(stderr," ");
	printf("GCG");
	debug(stderr,"out\n");
}

void in(){
	for(int i=0;i<2*level;i++) debug(stderr," ");
	printf("UCC");
	debug(stderr,"in\n");
}

void beg(){
	debug(stderr,"\n");
	for(int i=0;i<2*level;i++) debug(stderr," ");
	level++;
	printf("AGG");
	debug(stderr,"begin\n");
	debug(stderr,"\n");
}

void end(){
	debug(stderr,"\n");
	level--;
	for(int i=0;i<2*level;i++) debug(stderr," ");
	printf("UGU");
	debug(stderr,"end\n");
	debug(stderr,"\n");
}

main(){


	int n;
	scanf("%d",&n);
	
	if(n == 1)
		printf("UCCAGGUACUGUUGCGCGCCC\n");
	else if(n == 2)
		printf("UGCAGGUACACGAGGUACUGUUGAAGGUACAC\
GUGCUGAUGUUCCUGCUGUACGUGCAGGUACU\
GAUGCACGAGGUACUGAUACACGAGGUACUGA\
UGCACGAGGUACUGAUACACGAGGUACUGAUG\
CACGAGGUACUGAUACACGAGGUACUGAUGCA\
CGAGGUACUGAUACACGAGGUACUGAUGCACG\
AGGUACUGAUACACGUGUUGUUGUUGUUGUUG\
UUGUUGUUGUUGUUGAGCGCCC\n");

	else if(n == 3)
		printf("UGCAGGACGACGUCCAGGUACACGUGCACGUG\
CUGAUGAUGUACGACGACGUGCUGAUGCAGGU\
ACACGAGGUACUGUUGAUGUACGAGGUGAUGA\
UGAUGCUGAAGGUACACGAGGUACUGUUGAUG\
UACGGCGCCCUGUUGAUGAAGGUACUGAUGCA\
CGAGGUACUGAUGCACGAGGUACUGAUACUAC\
ACGAGGUACUGAUGCACGAGGUACUGAUGCAC\
GAGGUACUGAUACUACACGAGGUACUGAUGCA\
CGAGGUACUGAUGCACGAGGUACUGAUACUAC\
ACGUGUUGUUGUUGUUGUUGUUGUUGUUGUUG\
AAGGUACUGAUGCACGUGUUGAAGGUACACGU\
GCUGAAGGUACACGUGCUGAAGGUACACGUAC\
UACUGAAGGUACACGUGCUGAUGUUGUUGUUG\
UACGAGGUACUGAUGCACGUGUUGAUGAUGU\n");

	else if(n == 6)
		printf("UGCAGGACGACGUCCAGGUACACGUGCACGUG\
CUGAUGAUGUACGACGACGUGCUGAUGCAGGU\
ACACGAGGUACUGUUGAUGUACGAGGUGAUGA\
UGAUGAAGGAGGUACUGUGCGCCCUGUACGAC\
GACGACGACGACGUGCAGGUACUGAUGCACGA\
GGUACUGAUACACGAGGUACUGAUGCACGAGG\
UACUGAUACACGAGGUACUGAUGCACGAGGUA\
CUGAUACACGAGGUACUGAUGCACGAGGUACU\
GAUACACGAGGUACUGAUGCACGAGGUACUGA\
UACACGUGUUGUUGUUGUUGUUGUUGUUGUUG\
UUGUUGAGCGCCCUGUUGAACGACGAGGUACU\
GUACGAGGUACUGUUGAUGAUGAUGAAGGUAC\
ACGACGACGUGCACGUGCUGAUGAUGAUGAUG\
UACGACGACGAGGUACUGAUGAUGAUGCACGA\
CGACGUGUUGAUGAUGAAGGUACUGAUGCACG\
AGGUACUGAUGCACGAGGUACUGAUACUACAC\
GAGGUACUGAUGCACGAGGUACUGAUGCACGA\
GGUACUGAUACUACACGAGGUACUGAUGCACG\
AGGUACUGAUGCACGAGGUACUGAUACUACAC\
GUGUUGUUGUUGUUGUUGUUGUUGUUGUUGAA\
GGUACUGAUGCACGUGUUGAAGGUACACGUGC\
UGAAGGUACACGUGCUGAAGGUACACGUACUA\
CUGAAGGUACACGUGCUGAUGUUGUUGUUGUA\
CGAGGUACUGAUGCACGUGUUGAUGAUGU\n");

	if(n != 4 && n != 5) return 0;


	inc();
	
	beg();
		dec();
		next();
		beg();dec();end();
		
		next();
		
		beg(); dec();  prev(); inc(); next(); end();
		
		prev(); prev();
		
		beg(); dec(); next(); next(); inc(); prev(); prev(); end();
		
		in();
		inc();
		
	end();
	
	next();
	
	debug(stderr,"FIM 1a PARTE\n\n");
	

	
	for(int i=0;i<100;i+=n){
	
		debug(stderr,"OLHANDO N = %d\n",i);
		
		beg(); dec(); next(); next(); inc(); next(); next(); inc(); prev();prev();prev();prev(); end();
		next();
		beg(); dec(); next(); next(); inc(); next(); next(); inc(); prev();prev();prev();prev(); end();
		next();
		
		beg(); dec(); prev(); prev(); inc(); next(); next(); end();
		next();
		beg(); dec(); prev(); prev(); inc(); next(); next(); end();
		next();
		
		int A = i/10, B = i%10;
		while(A--) dec();
		next();
		while(B--) dec();
		prev();
		
		beg(); next(); next(); inc(); prev(); prev(); { beg(); dec(); end();} end();
		next();
		
		beg(); next(); inc(); prev(); { beg(); dec(); end();} end();
		next();
		
		next(); inc(); prev();
		
		beg(); next(); dec(); prev(); { beg(); dec(); end();} end();
		next();
		
		beg(); out(); stop(); end();
		
		beg(); dec(); end(); prev(); 
		beg(); dec(); end(); prev();
		beg(); dec(); end(); prev();
		beg(); dec(); end(); prev();
		beg(); dec(); end(); prev();
		beg(); dec(); end(); prev();
		
		prev();
		
		
		
		
	
	}
	
	beg(); dec(); end();
	out();
	
	stop();


}

详细

Test #1:

score: 100
Accepted
time: 2ms
memory: 3528kb

input:

1

output:

UCCAGGUACUGUUGCGCGCCC

result:

ok correct

Test #2:

score: 0
Accepted
time: 2ms
memory: 3572kb

input:

2

output:

UGCAGGUACACGAGGUACUGUUGAAGGUACACGUGCUGAUGUUCCUGCUGUACGUGCAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGUGUUGUUGUUGUUGUUGUUGUUGUUGUUGUUGAGCGCCC

result:

ok correct

Test #3:

score: 0
Accepted
time: 2ms
memory: 3568kb

input:

3

output:

UGCAGGACGACGUCCAGGUACACGUGCACGUGCUGAUGAUGUACGACGACGUGCUGAUGCAGGUACACGAGGUACUGUUGAUGUACGAGGUGAUGAUGAUGCUGAAGGUACACGAGGUACUGUUGAUGUACGGCGCCCUGUUGAUGAAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGUGUUGUUGU...

result:

ok correct

Test #4:

score: 0
Accepted
time: 2ms
memory: 3428kb

input:

6

output:

UGCAGGACGACGUCCAGGUACACGUGCACGUGCUGAUGAUGUACGACGACGUGCUGAUGCAGGUACACGAGGUACUGUUGAUGUACGAGGUGAUGAUGAUGAAGGAGGUACUGUGCGCCCUGUACGACGACGACGACGACGUGCAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGUGUUGU...

result:

ok correct

Test #5:

score: 0
Accepted
time: 1ms
memory: 3616kb

input:

1

output:

UCCAGGUACUGUUGCGCGCCC

result:

ok correct

Test #6:

score: 0
Accepted
time: 2ms
memory: 3472kb

input:

2

output:

UGCAGGUACACGAGGUACUGUUGAAGGUACACGUGCUGAUGUUCCUGCUGUACGUGCAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGUGUUGUUGUUGUUGUUGUUGUUGUUGUUGUUGAGCGCCC

result:

ok correct

Test #7:

score: 0
Accepted
time: 2ms
memory: 3448kb

input:

3

output:

UGCAGGACGACGUCCAGGUACACGUGCACGUGCUGAUGAUGUACGACGACGUGCUGAUGCAGGUACACGAGGUACUGUUGAUGUACGAGGUGAUGAUGAUGCUGAAGGUACACGAGGUACUGUUGAUGUACGGCGCCCUGUUGAUGAAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGUGUUGUUGU...

result:

ok correct

Test #8:

score: 0
Accepted
time: 2ms
memory: 3588kb

input:

4

output:

UGCAGGUACACGAGGUACUGUACGAGGUACUGAUGCACGUGUUGAUGAAGGUACACGACGUGCUGAUGAUGUUCCUGCUGUACGAGGUACACGACGUGCACGACGUGCUGAUGAUGAUGAUGUACGAGGUACACGACGUGCACGACGUGCUGAUGAUGAUGAUGUACGAGGUACUGAUGAUGCACGACGUGUACGAGGUACUGAUGAUGCACGACGUGUACGACGUGAAGGACGACGUGCUGAUGAAGGUACUGUUGUACGAGGACGUGCUGAAGGUACUGUUGUACGACGUGCUGAAGG...

result:

ok correct

Test #9:

score: 0
Accepted
time: 0ms
memory: 3436kb

input:

5

output:

UGCAGGUACACGAGGUACUGUACGAGGUACUGAUGCACGUGUUGAUGAAGGUACACGACGUGCUGAUGAUGUUCCUGCUGUACGAGGUACACGACGUGCACGACGUGCUGAUGAUGAUGAUGUACGAGGUACACGACGUGCACGACGUGCUGAUGAUGAUGAUGUACGAGGUACUGAUGAUGCACGACGUGUACGAGGUACUGAUGAUGCACGACGUGUACGACGUGAAGGACGACGUGCUGAUGAAGGUACUGUUGUACGAGGACGUGCUGAAGGUACUGUUGUACGACGUGCUGAAGG...

result:

ok correct

Test #10:

score: 0
Accepted
time: 2ms
memory: 3460kb

input:

6

output:

UGCAGGACGACGUCCAGGUACACGUGCACGUGCUGAUGAUGUACGACGACGUGCUGAUGCAGGUACACGAGGUACUGUUGAUGUACGAGGUGAUGAUGAUGAAGGAGGUACUGUGCGCCCUGUACGACGACGACGACGACGUGCAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGUGUUGU...

result:

ok correct