Priyansh31dec's blog

Invitation to ProSort, organized by IIIT-Delhi’s Programming Club Foobar
By Priyansh31dec, history, 4 years ago, In English

Elysium brings to you — “ ProSort ”, an online programming competition organized by IIITD’s programming club Foobar.

It is a team event that gives you a chance to go head-on-head with the country’s brightest algorithmic brains and solve a variety of challenging programming problems.

ProSort is a competitive programming contest aimed at college students. You will be required to solve algorithmic puzzles. The contest will be organized on Codeforces and players can form teams of up to 2 members. This will be a great opportunity to showcase your programming skills and also go head-on with the best programmers across the country.

Date 26th October 2020

Timing 6:30 to 8:30 pm

Venue Codeforces

The event will be a part of Elysium’20, IEEE IIIT Delhi’s online tech week.

We have a cash prize of Rs. 6,000 and goodies worth Rs. 72,000 for the top three teams (Both Indian and Non Indian).

Registration link

Contest link The contest starts today at 6:30 PM (IST)

All the best,

Team Elysium

  • Vote: I like it
  • +93
  • Vote: I do not like it

Comments Comments (42)
| Write comment?
»
4 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

It is Clashing with Codechef intern hiring challenge .

codechef intern

→ Reply
  • »
    »
    4 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    How did you got to know? Was there a blog post?

    Between thanks for letting me know :)

    → Reply
»
4 years ago, # |
← Rev. 5   Vote: I like it 0 Vote: I do not like it

Hi , I just submitted the form and now when I register on CF as a team their is no list of team names in the dropdown. Will it be updated or ..?? or we just have to simply register by selecting registering as a team member without selecting any team Priyansh31dec

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    You need to create a team first and then register as a team. Then select whoever is on the team and is participating.

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

For anybody who is not being able to register. Note: you need to request to join as a participant first and then click on the register button. You can then select either of the 2 options: 1) As an Individual 2) As a team

→ Reply
»
4 years ago, # |
  Vote: I like it +10 Vote: I do not like it

Non-Indian teams are also eligible for prizes xD

→ Reply
»
4 years ago, # |
  Vote: I like it +3 Vote: I do not like it

After registering for the contest as a team, do we need to fill the form as well?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Ideally, you should fill the form first and then register for the contest, but it is fine. Filling the form actually makes you eligible for prizes.

    → Reply
»
4 years ago, # |
  Vote: I like it +18 Vote: I do not like it

ICPC has capacity of 3 members so wouldn't it be nyc to have a max team strength of 3...

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +9 Vote: I do not like it

    Till last year we used to have this offline and used to have 2 members per team, so we made the difficulty of problems and length of the contest according to teams having at max 2 members this year too. I understand that it would have been better to participate in a team of 3 like ICPC xD

    → Reply
»
4 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Regarding the registration form, what does "Email ID" mean?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Email address. I don't know if its called something else .

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Priyansh31dec (previous revision, new revision, compare).

→ Reply
»
4 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Don't you think, you posted the invitation a bit late, considering the contest is today evening :P

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I know, we should have done that way early. Really sorry about that. All of us were busy setting up the contest and totally forgot about the announcement.

    → Reply
»
4 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Auto comment: topic has been updated by zyrch (previous revision, new revision, compare).

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Will this contest have ICPC rules?

→ Reply
»
4 years ago, # |
  Vote: I like it -8 Vote: I do not like it

is CodeChef down? I've solved two questions but it isn't accepting right now.

→ Reply
»
4 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Good contest bro, you should try your hands on official problem setting.

→ Reply
»
4 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Nice contest overall !! The problemset was also very good.

→ Reply
»
4 years ago, # |
  Vote: I like it +16 Vote: I do not like it

Nice Contest, when will the problems be available for practice?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    You should be able to upsolve problems check again.

    → Reply
»
4 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Will there be editorials?

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Nice contest.

→ Reply
»
4 years ago, # |
  Vote: I like it +19 Vote: I do not like it

We hope you all enjoyed the problems and learnt a thing or two as well. We thank everybody who participated and helped in making this event a huge success. We plan to upload the Editorial as well, till then you can discuss the solutions in the comments. The winners will shortly get a form to fill, to start with the prize distribution process. Indian and non-Indian teams will not be considered separately, so there are only 3 teams (Indian and non-Indian included) that will be considered as winners

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    When can we expect the editorial ??

    → Reply
  • »
    »
    4 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    I think that the editorial should have been ready and posted by now.

    So, when are you planning to release it (or write it) ?

    → Reply
»
4 years ago, # |
  Vote: I like it -9 Vote: I do not like it

Very Nice Problem-set!

Awaiting the editorials!

→ Reply
»
4 years ago, # |
  Vote: I like it +13 Vote: I do not like it

What is the test case 6 for Problem F ??

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

This was a nice contest with good problem-set. Hope to see more of these contests from your team!

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Priyansh31dec Can u explain 3rd test case of Problem D.

3 3

16 7 7

2 2 7

7 7 81

7 3 2

ans=1

Thanks

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Consider the path, (1,1)->(2,1)->(2,2)->(2,3)->(3,3). The product will be (2^6) * (7^1) * (3^4). Y=7*3*2. So, k=1 as Y^1 only divides the product

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anyone please tell how to solve problem b?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it -18 Vote: I do not like it

    This is my solution for this problem:

    /**
 * author: said_v15
**/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
 
typedef long long  ll;

#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define forn for(int i=0;i<n;i++) 
#define pb push_back 
#define sc second 
#define f first 
#define kek cout<<"\n"; 
#define rep(i,a,b) for(int i=a;i<b;i++)
#define all(v) ((v).begin()), ((v).end()) 
#define int ll


const ll MOD = 1e9 + 7;
const ll MOD1 = 998244353;
const int MAXN = 1000100;
const int INF = 1e8;
const ll LL_INF=1e18;
const double pi=3.1415926535;
using namespace std;
int divide(int a, int b)
{
          return (a+b-1)/b;
}

int32_t main()
{
    #if defined(_DEBUG)
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
    #endif
 fast;
 // cout << fixed << setprecision(12) << ans;
 // string al = "abcdefghijklmnopqrstuvwxyz";
 
 int questions=1;
 // cin>>questions;
 while(questions--)
 {
     ll n,m,k;
     cin>>n>>m>>k;
     vector<pair<ll,ll>> v(k);
     for(ll i=0;i<k;i++) cin>>v[i].f>>v[i].sc;
     sort(all(v));
     // for(auto x: v) cout<<x.f<<" "<<x.sc<<endl;
     ll ans=0;
     ll li=v[0].f, lj=v[0].sc;
     bool ok=1;
     for(ll l=1;l<k;l++) 
     {
            ll i=v[l].f;
            ll j=v[l].sc;
            if(i>li && j<lj) { 
                ans+=(i-li)*(m-lj+1);
                lj=min(lj,j);li=max(li,i);
            } 
            
     }
     ans+=(n-li+1)*(m-lj+1);
     cout<<ans;
     
     
     
     
 }
    
 
 // !!! LOOK AT NUMBER OF QUESTIONS IN A PROBLEM !!! (cin>>questions)
 

  // cout <<"Runtime is:"<<clock() * 1.0 / CLOCKS_PER_SEC <<endl;
   return 0;
   
}
    → Reply
»
4 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Can you open the contest for virtual participation. It just requires a second.

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

can anyone tell what's testcase 5 of problem B?

→ Reply