QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#647487	#5512. Stone Arranging 2	liuziao^#	25	1464ms	4500kb	C++23	768b	2024-10-17 14:24:55	2024-10-17 14:25:06

Judging History

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

[2024-10-17 14:25:06]
评测

测评结果：25
用时：1464ms
内存：4500kb

查看

[2024-10-17 14:24:55]
提交

answer

#include <bits/stdc++.h>

// #define int int64_t

const int kMaxN = 2e5 + 5;

int n;
int a[kMaxN];

void dickdreamer() {
  std::cin >> n;
  for (int i = 1; i <= n; ++i) std::cin >> a[i];
  for (int i = 1; i <= n; ++i) {
    for (int j = i - 1; j; --j) {
      if (a[i] == a[j]) {
        for (int k = j + 1; k < i; ++k) a[k] = a[i];
        break;
      }
    }
  }
  for (int i = 1; i <= n; ++i) std::cout << a[i] << '\n';
}

int32_t main() {
#ifdef ORZXKR
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
  int T = 1;
  // std::cin >> T;
  while (T--) dickdreamer();
  // std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
  return 0;
}

源文件, 语言: C++23

详细

Subtask #1:

score: 25

Accepted

Test #1:

score: 25

Accepted

time: 0ms

memory: 3528kb

input:

1
1

output:

result:

ok single line: '1'

Test #2:

score: 25

Accepted

time: 0ms

memory: 3668kb

input:

2
1
1

output:

1
1

result:

ok 2 lines

Test #3:

score: 25

Accepted

time: 0ms

memory: 3656kb

input:

output:

1
1
1

result:

ok 3 lines

Test #4:

score: 25

Accepted

time: 0ms

memory: 3584kb

input:

output:

result:

ok 2000 lines

Test #5:

score: 25

Accepted

time: 0ms

memory: 3580kb

input:

1
2

output:

result:

ok single line: '2'

Test #6:

score: 25

Accepted

time: 0ms

memory: 3652kb

input:

2
2
2

output:

2
2

result:

ok 2 lines

Test #7:

score: 25

Accepted

time: 0ms

memory: 3716kb

input:

output:

2
2
2

result:

ok 3 lines

Test #8:

score: 25

Accepted

time: 0ms

memory: 3712kb

input:

output:

result:

ok 2000 lines

Test #9:

score: 25

Accepted

time: 1ms

memory: 3608kb

input:

output:

result:

ok 2000 lines

Test #10:

score: 25

Accepted

time: 1ms

memory: 3608kb

input:

output:

result:

ok 2000 lines

Test #11:

score: 25

Accepted

time: 1ms

memory: 3740kb

input:

output:

result:

ok 2000 lines

Test #12:

score: 25

Accepted

time: 1ms

memory: 3604kb

input:

output:

result:

ok 2000 lines

Test #13:

score: 25

Accepted

time: 0ms

memory: 3724kb

input:

output:

result:

ok 2000 lines

Test #14:

score: 25

Accepted

time: 1ms

memory: 3608kb

input:

output:

result:

ok 2000 lines

Test #15:

score: 25

Accepted

time: 1ms

memory: 3612kb

input:

output:

81888042
43067133
107207954
11840122
12213120
1564709
591852273
88838690
961663051
516561909
168803248
844631608
873195256
827482724
743609376
619362989
538294587
82184630
144127319
243409882
211682139
271003483
663591071
168473717
654369346
16498799
591919038
700712177
385773734
618206739
813177482...

result:

ok 2000 lines

Test #16:

score: 25

Accepted

time: 1ms

memory: 3720kb

input:

output:

result:

ok 2000 lines

Test #17:

score: 25

Accepted

time: 1ms

memory: 3640kb

input:

output:

result:

ok 2000 lines

Test #18:

score: 25

Accepted

time: 1ms

memory: 3664kb

input:

2000
401665219
401665219
401665219
27125575
401665219
401665219
401665219
27125575
401665219
27125575
27125575
401665219
401665219
27125575
401665219
401665219
27125575
27125575
27125575
401665219
27125575
401665219
27125575
401665219
27125575
27125575
27125575
27125575
401665219
401665219
401665219...

output:

result:

ok 2000 lines

Test #19:

score: 25

Accepted

time: 1ms

memory: 3616kb

input:

output:

result:

ok 2000 lines

Test #20:

score: 25

Accepted

time: 1ms

memory: 3668kb

input:

output:

result:

ok 2000 lines

Test #21:

score: 25

Accepted

time: 0ms

memory: 3732kb

input:

output:

result:

ok 2000 lines

Test #22:

score: 25

Accepted

time: 1ms

memory: 3680kb

input:

output:

result:

ok 2000 lines

Test #23:

score: 25

Accepted

time: 1ms

memory: 3684kb

input:

output:

result:

ok 2000 lines

Test #24:

score: 25

Accepted

time: 1ms

memory: 3688kb

input:

output:

result:

ok 2000 lines

Test #25:

score: 25

Accepted

time: 1ms

memory: 3612kb

input:

output:

result:

ok 2000 lines

Test #26:

score: 25

Accepted

time: 0ms

memory: 3664kb

input:

output:

result:

ok 2000 lines

Test #27:

score: 25

Accepted

time: 1ms

memory: 3612kb

input:

output:

result:

ok 2000 lines

Test #28:

score: 25

Accepted

time: 1ms

memory: 3680kb

input:

output:

result:

ok 2000 lines

Subtask #2:

score: 0

Time Limit Exceeded

Test #29:

score: 35

Accepted

time: 12ms

memory: 4368kb

input:

output:

result:

ok 200000 lines

Test #30:

score: 35

Accepted

time: 12ms

memory: 4376kb

input:

output:

result:

ok 200000 lines

Test #31:

score: 35

Accepted

time: 1448ms

memory: 4408kb

input:

output:

result:

ok 200000 lines

Test #32:

score: 35

Accepted

time: 1446ms

memory: 4368kb

input:

output:

result:

ok 200000 lines

Test #33:

score: 35

Accepted

time: 1464ms

memory: 4376kb

input:

output:

result:

ok 200000 lines

Test #34:

score: 35

Accepted

time: 1451ms

memory: 4432kb

input:

output:

result:

ok 200000 lines

Test #35:

score: 35

Accepted

time: 1447ms

memory: 4368kb

input:

output:

result:

ok 200000 lines

Test #36:

score: 35

Accepted

time: 1451ms

memory: 4432kb

input:

output:

result:

ok 200000 lines

Test #37:

score: 35

Accepted

time: 1454ms

memory: 4500kb

input:

output:

result:

ok 200000 lines

Test #38:

score: 35

Accepted

time: 1454ms

memory: 4456kb

input:

output:

result:

ok 200000 lines

Test #39:

score: 35

Accepted

time: 1448ms

memory: 4428kb

input:

output:

result:

ok 200000 lines

Test #40:

score: 35

Accepted

time: 1449ms

memory: 4436kb

input:

output:

result:

ok 200000 lines

Test #41:

score: 0

Time Limit Exceeded

input:

output:

result:

Subtask #3:

score: 0

Skipped

Dependency #1:

100%

Accepted