QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#71347#5253. DenormalizationSorting#WA 8ms3864kbC++1.4kb2023-01-09 20:09:052023-01-09 20:09:06

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-01-09 20:09:06]
  • 评测
  • 测评结果:WA
  • 用时:8ms
  • 内存:3864kb
  • [2023-01-09 20:09:05]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ; 
typedef vector<int> vi;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 1e4 + 7 ;
const long double eps = 1e-6 ;

int n ;
long double a[ MAXN ] ;

const int lim = 1e4 ;

void solve ( ) {
    cin >> n ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        cin >> a[ i ] ;
    }
    for ( int i = 1 ; i <= lim ; ++ i ) {
        long double d = i / a[ 1 ] ;
        bool bad = false ;
        for ( int j = 2 ; j <= n ; ++ j ) {
            long double aux = a[ j ] * d ;
            int hh = round ( aux ) ;
            if ( aux - hh > eps || aux - hh < -eps ) {
                bad = true ;
                break ;
            }
            if ( hh < 1 || hh > lim ) {
                bad = true ;
                break ;
            }
        }
        if ( bad == false ) {
            for ( int j = 1 ; j <= n ; ++ j ) {
                long double aux = a[ j ] * d ;
                cout << round ( aux ) << "\n" ;
            }
            return ;
        }
    }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ; 
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}



詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3620kb

input:

2
0.909840249060
0.414958698174

output:

9665
4408

result:

ok good solution

Test #2:

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

input:

3
0.005731604132
0.696198848562
0.717826101486

output:

75
9110
9393

result:

ok good solution

Test #3:

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

input:

10
0.338936215010
0.390914583549
0.048893426174
0.446152513833
0.137891103101
0.017985796057
0.459132554353
0.201452557127
0.362800863500
0.358493585479

output:

5823
6716
840
7665
2369
309
7888
3461
6233
6159

result:

ok good solution

Test #4:

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

input:

100
0.027828573352
0.034289446708
0.021442608673
0.002752893865
0.091163859407
0.180717182268
0.012097751269
0.101332712254
0.087249881055
0.112643922419
0.016667180541
0.108449036530
0.050488448020
0.104216696303
0.120734059490
0.090096410766
0.066537631979
0.046668105514
0.174836851156
0.084908984...

output:

1486
1831
1145
147
4868
9650
646
5411
4659
6015
890
5791
2696
5565
6447
4811
3553
2492
9336
4534
5302
193
5082
58
1438
4729
3774
542
5876
1641
5574
1443
9374
7710
9570
1413
3054
396
2768
8066
1774
1546
9548
1546
8339
411
3862
3496
3418
8165
4760
7829
4709
8174
8816
4396
7811
8148
2957
1239
1857
4361...

result:

ok good solution

Test #5:

score: 0
Accepted
time: 7ms
memory: 3740kb

input:

10000
0.014153431495
0.006246805276
0.014846752535
0.008905976745
0.012146085543
0.003020528319
0.010107617948
0.005218062088
0.014054879627
0.009239669913
0.008637984822
0.013371932468
0.009493829995
0.005771335736
0.002264963994
0.010799210007
0.015999982294
0.014564928771
0.001206828144
0.0056243...

output:

8186
3613
8587
5151
7025
1747
5846
3018
8129
5344
4996
7734
5491
3338
1310
6246
9254
8424
698
3253
18
6747
6383
7580
1483
2171
4328
7368
2072
8229
3813
8743
9601
5375
9211
4221
6853
8470
8388
929
2604
4103
8579
2768
1138
3754
2139
7163
5876
525
8775
4406
7769
1654
3080
734
3950
4290
6828
4796
4006
4...

result:

ok good solution

Test #6:

score: 0
Accepted
time: 8ms
memory: 3864kb

input:

10000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.010000000000
0.0100000...

output:

1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
...

result:

ok good solution

Test #7:

score: -100
Wrong Answer
time: 2ms
memory: 3660kb

input:

10000
0.000001731921
0.000003463842
0.000005195763
0.000006927684
0.000008659605
0.000010391525
0.000012123446
0.000013855367
0.000015587288
0.000017319209
0.000019051130
0.000020783051
0.000022514972
0.000024246893
0.000025978814
0.000027710735
0.000029442656
0.000031174576
0.000032906497
0.0000346...

output:


result:

wrong output format Unexpected end of file - int32 expected