QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#125563	#6319. Parallel Processing (Easy)	Energy_is_not_over^#	WA	1ms	3492kb	C++17	3.5kb	2023-07-16 21:33:53	2023-07-16 21:33:54

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-07-16 21:33:54]
评测

测评结果：WA
用时：1ms
内存：3492kb

查看

[2023-07-16 21:33:53]
提交

answer

//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")

#ifdef __APPLE__
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>
#else
#include <bits/stdc++.h>
#endif

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#if __APPLE__
#define D for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define D while (false)
#define LOG(...)
#endif

const int max_n = -1, inf = 1000111222;

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    string data="0 1 1 2 2 3 3 4 4 5 2 1 2 3 4 5 6 6 7 2 3 2 4 4 5 4 6 2 1 2 3 4 5 6 6 7 2 3 2 4 4 5 4 6 3 1 2 3 4 5 6 7 8 2 3 2 4 6 7 6 8 4 5 4 6 4 7 4 8 3 1 2 3 4 5 6 7 8 2 3 2 4 6 7 6 8 4 5 4 6 4 7 4 8 3 1 2 3 4 5 6 7 8 2 3 2 4 6 7 6 8 4 5 4 6 4 7 4 8 3 1 2 3 4 5 6 7 8 2 3 2 4 6 7 6 8 4 5 4 6 4 7 4 8 4 1 2 3 4 5 6 8 9 2 3 2 4 6 7 9 10 4 5 4 6 4 7 10 11 7 8 7 9 7 10 7 11 4 1 2 3 4 5 6 8 9 2 3 2 4 6 7 9 10 4 5 4 6 4 7 10 11 7 8 7 9 7 10 7 11 4 1 2 3 4 5 6 8 9 2 3 2 4 6 7 9 10 4 5 4 6 4 7 10 11 7 8 7 9 7 10 7 11 5 1 2 3 4 5 6 7 8 2 3 2 4 6 8 9 10 4 5 4 6 4 8 10 11 6 7 8 9 8 11 12 13 8 10 11 12 11 13 13 14 5 1 2 3 4 5 6 7 8 2 3 2 4 6 8 9 10 4 5 4 6 4 8 10 11 6 7 8 9 8 11 12 13 8 10 11 12 11 13 13 14 6 1 2 3 4 5 6 8 9 2 3 2 4 6 7 9 10 4 5 4 6 4 7 10 11 7 8 7 9 7 11 12 13 7 10 11 12 11 13 14 15 -1 9 13 14 13 15 15 16 6 1 2 3 4 5 6 8 9 2 3 2 4 6 7 9 10 4 5 4 6 4 7 10 11 7 8 7 9 7 11 12 13 7 10 11 12 11 13 14 15 -1 9 13 14 13 15 15 16 7 1 2 3 4 5 6 8 9 2 4 4 5 6 7 9 10 4 6 4 7 7 8 10 11 7 9 7 10 7 11 12 13 4 8 11 12 11 13 14 15 2 3 -1 6 13 14 13 15 -1 4 2 5 15 16 15 16";
    stringstream stt;
    stt<<data;
    int n;
    cin>>n;
    for (int i=1;i<=n-1;i++){
        int s;
        stt>>s;
        for (int j=0;j<s;j++){
            for (int k=1;k<=4;k++){
                int a,b;
                stt>>a>>b;
            }
        }
    }
    {
        int s;
        stt>>s;
        cout<<s<<"\n";
        for (int j=0;j<s;j++){
            for (int k=1;k<=4;k++){
                int a,b;
                stt>>a>>b;
                if (a==-1){
                    cout<<100<<" "<<100<<" "<<100<<"\n";
                }
                else{
                    cout<<b<<" "<<a<<" "<<b<<"\n";
                }
            }
        }
    }
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3448kb

input:

output:

result:

ok AC

Test #2:

score: 0

Accepted

time: 1ms

memory: 3464kb

input:

output:

result:

ok AC

Test #3:

score: 0

Accepted

time: 1ms

memory: 3452kb

input:

output:

result:

ok AC

Test #4:

score: 0

Accepted

time: 1ms

memory: 3400kb

input:

output:

result:

ok AC

Test #5:

score: 0

Accepted

time: 0ms

memory: 3400kb

input:

output:

result:

ok AC

Test #6:

score: 0

Accepted

time: 1ms

memory: 3428kb

input:

output:

result:

ok AC

Test #7:

score: 0

Accepted

time: 1ms

memory: 3460kb

input:

output:

result:

ok AC

Test #8:

score: 0

Accepted

time: 1ms

memory: 3436kb

input:

output:

result:

ok AC

Test #9:

score: 0

Accepted

time: 1ms

memory: 3492kb

input:

output:

result:

ok AC

Test #10:

score: 0

Accepted

time: 1ms

memory: 3436kb

input:

output:

result:

ok AC

Test #11:

score: 0

Accepted

time: 1ms

memory: 3388kb

input:

output:

result:

ok AC

Test #12:

score: 0

Accepted

time: 1ms

memory: 3448kb

input:

output:

result:

ok AC

Test #13:

score: 0

Accepted

time: 1ms

memory: 3448kb

input:

output:

6
2 1 2
4 3 4
6 5 6
9 8 9
3 2 3
4 2 4
7 6 7
10 9 10
5 4 5
6 4 6
7 4 7
11 10 11
8 7 8
9 7 9
11 7 11
13 12 13
10 7 10
12 11 12
13 11 13
15 14 15
100 100 100
14 13 14
15 13 15
16 15 16

result:

ok AC

Test #14:

score: 0

Accepted

time: 1ms

memory: 3400kb

input:

output:

6
2 1 2
4 3 4
6 5 6
9 8 9
3 2 3
4 2 4
7 6 7
10 9 10
5 4 5
6 4 6
7 4 7
11 10 11
8 7 8
9 7 9
11 7 11
13 12 13
10 7 10
12 11 12
13 11 13
15 14 15
100 100 100
14 13 14
15 13 15
16 15 16

result:

ok AC

Test #15:

score: -100

Wrong Answer

time: 1ms

memory: 3448kb

input:

output:

7
2 1 2
4 3 4
6 5 6
9 8 9
4 2 4
5 4 5
7 6 7
10 9 10
6 4 6
7 4 7
8 7 8
11 10 11
9 7 9
10 7 10
11 7 11
13 12 13
8 4 8
12 11 12
13 11 13
15 14 15
3 2 3
100 100 100
14 13 14
15 13 15
100 100 100
5 2 5
16 15 16
16 15 16

result:

wrong answer L = 7 is larger than 6