oj.uz

Submission #991373

# Submission time Handle Problem Language Result Execution time Memory
991373 2024-06-02T07:53:57 Z Khanhcsp2 Magic Show (APIO24_show) C++17
100 / 100
 3 ms 836 KB 
#include<bits/stdc++.h>
#include "Alice.h"
#define el '\n'
#define fi first
#define sc second
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int N=1e5+11;
vector<pii> tree;
ll x, mod[N];
long long setN(ll n)
{
    cin >> x;
    return x;
}
//ll lcm(ll a, ll b)
//{
//    return a*b/__gcd(a, b);
//}
std::vector<std::pair<int,int>> Alice()
{
    // add your code here
 
    // change below into your code
    long long x = setN(5000);
 
    for(int i=1; i<5000; i++) tree.push_back({x%i+1, i+1});
    return tree;
}
//long long Bob(std::vector<std::pair<int,int>> V){
//	 add your code here
//
//     change this into your code
//    for(int i=1;i<=5000;i++) mod[i]=-1;
//    for(auto x:V) mod[x.sc-1]=x.fi-1;
//    ll lcmm=1, ans=0;
//    for(int i=1;i<=5000;i++)
//    {
//        if(mod[i]==-1) continue;
//        while(ans%i!=mod[i]) ans+=lcmm;
//        lcmm=lcm(lcmm, i);
//    }
//    int ch=0;
//    for(int i=1;i<=5000;i++)
//    {
//        if(mod[i]==-1) continue;
//        if((x%i)!=mod[i]) ch=1;
//    }
//    if(ch==0) return ans;
//    else return -1;
//    return ans;
//}
 
//void sol()
//{
//    Alice();
////    for(auto x:tree) cout << x.fi << ' ' << x.sc << el;
//    cout << Bob(tree);
//}
//signed main()
//{
////    freopen("divisor.INP", "r", stdin);
////    freopen("divisor.OUT", "w", stdout);
//    ios_base::sync_with_stdio(0);
//    cin.tie(0);
//    int t=1;
//    //cin >> t;
//    while(t--)
//    {
//        sol();
//    }
//}
#include<bits/stdc++.h>
#include "Bob.h"
#define el '\n'
#define fi first
#define sc second
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int N=1e5+11;
vector<pii> tree;
ll x, mod[N];
//long long setN(int n)
//{
//    cin >> x;
//    return x;
//}
ll lcm(ll a, ll b)
{
    return a*b/__gcd(a, b);
}
//std::vector<std::pair<int,int>> Alice()
//{
//    // add your code here
//
//    // change below into your code
//    long long x = setN(5000);
//
//    for(int i=1; i<5000; i++) tree.push_back({x%i+1, i+1});
//    return tree;
//}
long long Bob(std::vector<std::pair<int,int>> V){
	// add your code here
 
    // change this into your code
    for(int i=1;i<=5000;i++) mod[i]=-1;
    for(auto x:V) mod[x.sc-1]=x.fi-1;
    ll lcmm=1, ans=0;
    for(int i=1;i<=5000;i++)
    {
        if(mod[i]==-1) continue;
        while(ans%i!=mod[i]) ans+=lcmm;
        lcmm=lcm(lcmm, i);
    }
//    int ch=0;
//    for(int i=1;i<=5000;i++)
//    {
//        if(mod[i]==-1) continue;
//        if((x%i)!=mod[i]) ch=1;
//    }
//    if(ch==0) return ans;
//    else return -1;
    return ans;
}
 
//void sol()
//{
//    Alice();
////    for(auto x:tree) cout << x.fi << ' ' << x.sc << el;
//    cout << Bob(tree);
//}
//signed main()
//{
////    freopen("divisor.INP", "r", stdin);
////    freopen("divisor.OUT", "w", stdout);
//    ios_base::sync_with_stdio(0);
//    cin.tie(0);
//    int t=1;
//    //cin >> t;
//    while(t--)
//    {
//        sol();
//    }
//}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 824 KB Correct.
2 Correct 1 ms 828 KB Correct.
3 Correct 1 ms 824 KB Correct.
4 Correct 2 ms 828 KB Correct.
5 Correct 1 ms 828 KB Correct.
6 Correct 1 ms 824 KB Correct.
7 Correct 2 ms 824 KB Correct.
8 Correct 1 ms 828 KB Correct.
9 Correct 2 ms 824 KB Correct.
10 Correct 1 ms 824 KB Correct.
11 Correct 3 ms 824 KB Correct.
12 Correct 2 ms 820 KB Correct.

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 824 KB Correct.
2 Correct 1 ms 828 KB Correct.
3 Correct 1 ms 824 KB Correct.
4 Correct 2 ms 828 KB Correct.
5 Correct 1 ms 828 KB Correct.
6 Correct 1 ms 824 KB Correct.
7 Correct 2 ms 824 KB Correct.
8 Correct 1 ms 828 KB Correct.
9 Correct 2 ms 824 KB Correct.
10 Correct 1 ms 824 KB Correct.
11 Correct 3 ms 824 KB Correct.
12 Correct 2 ms 820 KB Correct.
13 Correct 2 ms 824 KB Correct.
14 Correct 2 ms 820 KB Correct.
15 Correct 2 ms 824 KB Correct.
16 Correct 1 ms 824 KB Correct.
17 Correct 1 ms 824 KB Correct.
18 Correct 2 ms 796 KB Correct.
19 Correct 2 ms 828 KB Correct.
20 Correct 2 ms 824 KB Correct.
21 Correct 2 ms 832 KB Correct.
22 Correct 2 ms 820 KB Correct.
23 Correct 1 ms 824 KB Correct.
24 Correct 1 ms 824 KB Correct.

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 824 KB Correct.
2 Correct 1 ms 828 KB Correct.
3 Correct 1 ms 824 KB Correct.
4 Correct 2 ms 828 KB Correct.
5 Correct 1 ms 828 KB Correct.
6 Correct 1 ms 824 KB Correct.
7 Correct 2 ms 824 KB Correct.
8 Correct 1 ms 828 KB Correct.
9 Correct 2 ms 824 KB Correct.
10 Correct 1 ms 824 KB Correct.
11 Correct 3 ms 824 KB Correct.
12 Correct 2 ms 820 KB Correct.
13 Correct 2 ms 824 KB Correct.
14 Correct 2 ms 820 KB Correct.
15 Correct 2 ms 824 KB Correct.
16 Correct 1 ms 824 KB Correct.
17 Correct 1 ms 824 KB Correct.
18 Correct 2 ms 796 KB Correct.
19 Correct 2 ms 828 KB Correct.
20 Correct 2 ms 824 KB Correct.
21 Correct 2 ms 832 KB Correct.
22 Correct 2 ms 820 KB Correct.
23 Correct 1 ms 824 KB Correct.
24 Correct 1 ms 824 KB Correct.
25 Correct 2 ms 836 KB Correct.
26 Correct 2 ms 824 KB Correct.
27 Correct 3 ms 824 KB Correct.
28 Correct 2 ms 836 KB Correct.
29 Correct 2 ms 824 KB Correct.
30 Correct 1 ms 824 KB Correct.
31 Correct 2 ms 824 KB Correct.
32 Correct 2 ms 832 KB Correct.
33 Correct 1 ms 836 KB Correct.
34 Correct 1 ms 828 KB Correct.
35 Correct 2 ms 824 KB Correct.
36 Correct 2 ms 824 KB Correct.
37 Correct 2 ms 824 KB Correct.
38 Correct 1 ms 836 KB Correct.
39 Correct 2 ms 836 KB Correct.
40 Correct 2 ms 836 KB Correct.
41 Correct 2 ms 824 KB Correct.
42 Correct 1 ms 824 KB Correct.
43 Correct 3 ms 824 KB Correct.
44 Correct 1 ms 828 KB Correct.